Randomness for non-computable measures

DOI10.1090/S0002-9947-2013-05682-6zbMath1307.03026MaRDI QIDQ2846975

Joseph S. Miller, Adam R. Day

Publication date: 4 September 2013

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

zbMATH Keywords

randomness; neutral measure; noncomputable measure; PA-complete Turing degree

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

03D30: Other degrees and reducibilities in computability and recursion theory

03D32: Algorithmic randomness and dimension

Related Items

Computability of Subsets of Metric Spaces, UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS, A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES, ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY, Measures and their random reals, MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS, Effective randomness for continuous measures, Point Degree Spectra of Represented Spaces, Continuous randomness via transformations of 2-random sequences, COMPUTABLY COMPACT METRIC SPACES, Turing degrees and randomness for continuous measures, Mass problems associated with effectively closed sets, Energy randomness, Schnorr randomness for noncomputable measures, Martin-Löf random generalized Poisson processes, Equivalences between learning of data and probability distributions, and their applications, The random members of a \({\Pi }_{1}^{0}\) class, Characterizing the continuous degrees, Cone avoidance and randomness preservation, Independence, relative randomness, and PA degrees, How much randomness is needed for statistics?, Algorithmic tests and randomness with respect to a class of measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively closed sets of measures and randomness
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Uniform test of algorithmic randomness over a general space
• A generalization of Brouwer's fixed point theorem
• Algorithmic Randomness and Complexity
• Measures and their random reals
• Degrees of unsolvability of continuous functions
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Arithmetical Reducibilities I
• The definition of random sequences
• ∏ 0 1 Classes and Degrees of Theories
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction