Measures and their random reals

DOI10.1090/S0002-9947-2015-06184-4zbMath1375.03050arXiv0802.2705OpenAlexW2100382100MaRDI QIDQ5247029

Jan Reimann, Theodore A. Slaman

Publication date: 22 April 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.2705

zbMATH Keywords

probability measuresrandomnessTuring degreesrandom realsnon-computable realsnon-hyperarithmetical reals

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (23)

Energy randomness ⋮ UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Schnorr randomness for noncomputable measures ⋮ Martin-Löf random generalized Poisson processes ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Turing degrees and randomness for continuous measures ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ On the gap between trivial and nontrivial initial segment prefix-free complexity ⋮ On the Reals Which Cannot Be Random ⋮ Independence, relative randomness, and PA degrees ⋮ Randomness for computable measures and initial segment complexity ⋮ Two more characterizations of \(K\)-triviality ⋮ Effectively closed sets of measures and randomness ⋮ Strong reductions in effective randomness ⋮ Equivalences between learning of data and probability distributions, and their applications ⋮ RANDOMNESS IN THE HIGHER SETTING ⋮ Randomness for non-computable measures ⋮ Measures and their random reals ⋮ Effective randomness for continuous measures ⋮ Cone avoidance and randomness preservation ⋮ THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively closed sets of measures and randomness
• Members of countable \(\Pi ^ 0_ 1\) classes
• Descriptive set theory
• Mathematical metaphysics of randomness
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Perfect subsets of definable sets of real numbers
• Uniform test of algorithmic randomness over a general space
• Randomness for non-computable measures
• Algorithmic Randomness and Complexity
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• Degrees joining to 0′
• Randomness conservation inequalities; information and independence in mathematical theories
• Every sequence is reducible to a random one
• Measures and their random reals
• Computability and Randomness
• Degrees of Unsolvability. (AM-55)
• On the Cardinality of $$ \sum_2^1 $$ Sets of Reals
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences

This page was built for publication: Measures and their random reals