arXiv · 2306.12769
Ergodic theorem and algorithmic randomness
Abstract
We prove the constructive version of Birkhoff's ergodic theorem following Vyugin but trying to separate and state explicitly the combinatorial statement on which this proof is based. We pose some questions related to this statement (and the effective ergodic theorem in general).
Explore related subjects
Keep this discovery
Alexander Shen. 2023-06-22. Ergodic theorem and algorithmic randomness. https://arxiv.org/abs/2306.12769
Cite the original work for its findings. Save a collection to share your selection of sources.