Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
From MaRDI portal
Publication:2845878
DOI10.1090/S0002-9939-2012-11179-7zbMath1298.03103OpenAlexW2082158498MaRDI QIDQ2845878
Joseph S. Miller, Noam Greenberg, Keng Meng Ng, Johanna N. Y. Franklin
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
Measure-preserving transformations (28D05) Dynamical aspects of measure-preserving transformations (37A05) Ergodic theorems, spectral theory, Markov operators (37A30) Algorithmic randomness and dimension (03D32)
Related Items (15)
Computability of convergence rates in the ergodic theorem for Martin-Löf random points ⋮ UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ Randomness, Computation and Mathematics ⋮ On zeros of Martin-Löf random Brownian motion ⋮ Randomness and uniform distribution modulo one ⋮ USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE ⋮ Computing from projections of random points ⋮ Algorithmic randomness and Fourier analysis ⋮ ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS ⋮ Martin-Löf randomness implies multiple recurrence in effectively closed sets ⋮ Schnorr randomness and the Lebesgue differentiation theorem ⋮ Unnamed Item ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ A Church-Turing thesis for randomness?
Cites Work
- 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
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Ergodic-Type Characterizations of Algorithmic Randomness
This page was built for publication: Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
