Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
DOI10.1090/S0002-9939-2012-11179-7zbMATH Open1298.03103OpenAlexW2082158498MaRDI QIDQ2845878FDOQ2845878
Authors: Johanna N. Y. Franklin, Noam Greenberg, Joseph S. Miller, Keng Meng Ng 
Publication date: 3 September 2013
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-2012-11179-7
Recommendations
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Ergodic theorems for individual random sequences
- Randomness and non-ergodic systems
- Computability of convergence rates in the ergodic theorem for Martin-Löf random points
- Applications of Effective Probability Theory to Martin-Löf Randomness
Algorithmic randomness and dimension (03D32) Measure-preserving transformations (28D05) Dynamical aspects of measure-preserving transformations (37A05) Ergodic theorems, spectral theory, Markov operators (37A30)
Cites Work
- Title not available (Why is that?)
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Randomness on computable probability spaces -- a dynamical point of view
- Title not available (Why is that?)
- Ergodic-Type Characterizations of Algorithmic Randomness
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Cited In (20)
- Algorithmic randomness and Fourier analysis
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
- A Church-Turing thesis for randomness?
- Computing from projections of random points
- Title not available (Why is that?)
- Randomness, computation and mathematics
- Weihrauch-completeness for layerwise computability
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Universal coding and prediction on ergodic random points
- On zeros of Martin-Löf random Brownian motion
- Computable Measure Theory and Algorithmic Randomness
- Using almost-everywhere theorems from analysis to study randomness
- Computability of convergence rates in the ergodic theorem for Martin-Löf random points
- Randomness and uniform distribution modulo one
- Randomness and non-ergodic systems
- Schnorr randomness and the Lebesgue differentiation theorem
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups
- Martin-Löf randomness implies multiple recurrence in effectively closed sets
- On analogues of the Church-Turing thesis in algorithmic randomness
- Applications of Effective Probability Theory to Martin-Löf Randomness
This page was built for publication: Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845878)
