Effective randomness for continuous measures
From MaRDI portal
Publication:5862176
DOI10.1090/jams/980OpenAlexW3148730244MaRDI QIDQ5862176
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
Descriptive set theory (03E15) Probabilistic measure theory (60A10) Inner models, including constructibility, ordinal definability, and core models (03E45) Algorithmic randomness and dimension (03D32)
Related Items (4)
Three topological reducibilities for discontinuous functions ⋮ Randomness, Computation and Mathematics ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Turing degrees and randomness for continuous measures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Borel determinacy
- Defining the Turing jump
- Strong reductions in effective randomness
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Uniform test of algorithmic randomness over a general space
- Die Widerspruchsfreiheit der allgemeinen Mengenlehre
- Randomness for non-computable measures
- Algorithmic Randomness and Complexity
- Lowness and nullsets
- Jumping through the transfinite: the master code hierarchy of Turing degrees
- A degree-theoretic definition of the ramified analytical hierarchy
- Set Theory
- Measures and their random reals
- Constructibility
- Computability and Randomness
- Degrees of Unsolvability. (AM-55)
- The axiom of determinateness and reduction principles in the analytical hierarchy
- Homeomorphic Measures in Metric Spaces
- Degrees of unsolvability of constructible sets of integers
- A note on the hyperarithmetical hierarchy
- Higher set theory and mathematical practice
- 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
This page was built for publication: Effective randomness for continuous measures
