USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
From MaRDI portal
Publication:5346702
DOI10.1017/bsl.2016.10zbMath1401.03079arXiv1411.0732OpenAlexW2963908355MaRDI QIDQ5346702
Jing Zhang, Kenshi Miyabe, André Nies
Publication date: 26 May 2017
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0732
Ergodicity, mixing, rates of mixing (37A25) Martingales with continuous parameter (60G44) Ergodic theorems, spectral theory, Markov operators (37A30) Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)
Related Items
A Computational Approach to the Borwein-Ditor Theorem, Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility, RANDOMNESS NOTIONS AND REVERSE MATHEMATICS, CHAITIN’S Ω AS A CONTINUOUS FUNCTION, Lowness, Randomness, and Computable Analysis, Randomness and initial segment complexity for measures, Computable Measure Theory and Algorithmic Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Randomness on computable probability spaces -- a dynamical point of view
- Martingale proof of the existence of Lebesgue points
- Ergodic theorems for individual random sequences
- Characterization of Kurtz randomness by a differentiation theorem
- Density, forcing, and the covering problem
- 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)
- The mean ergodic theorem
- Randomness and Non-ergodic Systems
- Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
- Schnorr randomness and the Lebesgue differentiation theorem
- Denjoy, Demuth and density
- COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
- Differentiability of polynomial time computable functions
- Algorithmic Randomness and Complexity
- Cupping with random sets
- Lowness and nullsets
- Randomness and Computability: Open Questions
- Randomness and differentiability
- Counting the changes of random Δ20 sets
- Subadditive mean ergodic theorems
- Algorithmic Aspects of Lipschitz Functions
- Probability
