Computability of convergence rates in the ergodic theorem for Martin-Löf random points
From MaRDI portal
Publication:5043603
DOI10.4115/jla.2022.14.2OpenAlexW4297859177WikidataQ114986348 ScholiaQ114986348MaRDI QIDQ5043603
Publication date: 6 October 2022
Published in: Journal of Logic and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4115/jla.2022.14.2
Measure-preserving transformations (28D05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
- On the speed of convergence in the ergodic theorem
- Recursive events in random sequences
- Universality, optimality, and randomness deficiency
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Uniform test of algorithmic randomness over a general space
- Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
- Local stability of ergodic averages
- An Application of Martin-Löf Randomness to Effective Probability Theory
- Applications of Effective Probability Theory to Martin-Löf Randomness
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- Algorithmic Information Theory
- Algorithmic Randomness
- The definition of random sequences
This page was built for publication: Computability of convergence rates in the ergodic theorem for Martin-Löf random points