Randomness and non-ergodic systems
From MaRDI portal
Abstract: We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space is not Martin-Lof random, there is a computable measure-preserving transformation and a computable set that witness that x is not typical with respect to the ergodic theorem, which gives us the converse of a theorem by V'yugin. We further show that if x is weakly 2-random, then it satisfies the ergodic theorem for all computable measure-preserving transformations and all lower semi-computable functions.
Recommendations
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- Randomness on computable probability spaces -- a dynamical point of view
- Ergodic-Type Characterizations of Algorithmic Randomness
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Randomness and the ergodic decomposition
Cited in
(22)- Nonrobustness property of the individual ergodic theorem
- An approach of randomness of a sample based on its weak ergodic limit
- Computability of the ergodic decomposition
- Algorithmic randomness and Fourier analysis
- A Church-Turing thesis for randomness?
- Classical, quantum and biological randomness as relative unpredictability
- Realizing semicomputable simplices by computable dynamical systems
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- On stability of probability laws with respect to small violations of algorithmic randomness
- ON THE STRENGTH OF TWO RECURRENCE THEOREMS
- Randomness and the ergodic decomposition
- scientific article; zbMATH DE number 3844684 (Why is no real title available?)
- Probability, ergodicity, irreversibility and dynamical systems
- Decision Systems and Nonstochastic Randomness
- scientific article; zbMATH DE number 599600 (Why is no real title available?)
- Computable Measure Theory and Algorithmic Randomness
- Universal coding and prediction on ergodic random points
- Using almost-everywhere theorems from analysis to study randomness
- Randomness extraction in computability theory
- Ergodic theorems and converses for PSPACE functions
- Randomness and invariance
- Algorithmic randomness and the weak merging of computable probability measures
This page was built for publication: Randomness and non-ergodic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2801859)
