Ergodic-Type Characterizations of Algorithmic Randomness
From MaRDI portal
Recommendations
- On elementary computability-theoretic properties of algorithmic randomness
- A generalized characterization of algorithmic probability
- scientific article; zbMATH DE number 1160361
- Computable Measure Theory and Algorithmic Randomness
- Algorithmic randomness and measures of complexity
- scientific article; zbMATH DE number 1487695
- The equivalence of definitions of algorithmic randomness
- scientific article; zbMATH DE number 5057386
- Randomness and the ergodic decomposition
Cited in
(15)- Applications of Effective Probability Theory to Martin-Löf Randomness
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- A Church-Turing thesis for randomness?
- scientific article; zbMATH DE number 599600 (Why is no real title available?)
- Randomness, computation and mathematics
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- The Kučera-Gács theorem revisited by Levin
- Randomness and the ergodic decomposition
- An approach of randomness of a sample based on its weak ergodic limit
- On zeros of Martin-Löf random Brownian motion
- Computable Measure Theory and Algorithmic Randomness
- The dimension of ergodic random sequences
- Randomness and non-ergodic systems
- Theorems on the variable-length intrinsic randomness
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
This page was built for publication: Ergodic-Type Characterizations of Algorithmic Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576190)
