Effective randomness for continuous measures

DOI10.1090/JAMS/980MaRDI QIDQ5862176zbMATH OpenOpenAlexFDO

Authors Jan Reimann, Theodore A. Slaman

Publication date 7 March 2022

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

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Probabilistic measure theory (60A10)

Recommendations

• Measures and their random reals
• Turing degrees and randomness for continuous measures
• Random elements in effective topological spaces with measure.
• Algorithmic randomness of continuous functions
• Independence, randomness and the axiom of choice

Cites work

• A degree-theoretic definition of the ramified analytical hierarchy
• A note on the hyperarithmetical hierarchy
• A tt version of the Posner-Robinson theorem
• Algorithmic randomness and complexity.
• Borel determinacy
• Computability and Randomness
• Constructibility
• Defining the Turing jump
• Degrees of unsolvability of constructible sets of integers
• Degrees of Unsolvability. (AM-55)
• Die Widerspruchsfreiheit der allgemeinen Mengenlehre
• Higher set theory and mathematical practice
• Homeomorphic Measures in Metric Spaces
• scientific article; zbMATH DE number 4053595 (Why is no real title available?)
• scientific article; zbMATH DE number 3532844 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3993574 (Why is no real title available?)
• scientific article; zbMATH DE number 3349789 (Why is no real title available?)
• Jumping through the transfinite: the master code hierarchy of Turing degrees
• Lowness and nullsets
• Measures and their random reals
• Randomness for non-computable measures
• Set Theory
• Set theory.
• Strong reductions in effective randomness
• The axiom of determinateness and reduction principles in the analytical hierarchy
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The fine structure of the constructible hierarchy
• Uniform test of algorithmic randomness over a general space
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(8)

• Randomness, computation and mathematics
• Three topological reducibilities for discontinuous functions
• Continuous randomness via transformations of 2-random sequences
• Turing degrees and randomness for continuous measures
• Effective Randomness for Continuous Measures
• Determinacy on the edge of second-order arithmetic. I
• Borel graphable equivalence relations
• The metamathematics of separated determinacy

This page was built for publication: Effective randomness for continuous measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862176)