scientific article; zbMATH DE number 1223737
From MaRDI portal
Publication:4219053
zbMath0914.03054MaRDI QIDQ4219053
Weihrauch, Klaus, Peter H. Hertling
Publication date: 14 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomness preservationmeasure zerorandomness testscomputable analytic functioninfinite co-r.e. random setsinfinite random sequencesrandom real numbersrandom set of numbersrandomness spacesseparable topological spaces with a measure
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of numerations, effectively presented structures (03D45)
Related Items (10)
When does randomness come from randomness? ⋮ Computability of probability measures and Martin-Löf randomness over metric spaces ⋮ Random elements in effective topological spaces with measure. ⋮ Computing a Glimpse of Randomness ⋮ Uniform test of algorithmic randomness over a general space ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. ⋮ The Kolmogorov complexity of real numbers. ⋮ Randomness on full shift spaces ⋮ Feasible analysis, randomness, and base invariance
This page was built for publication:
