On effective Birkhoff's ergodic theorem for computable actions of amenable groups
From MaRDI portal
Publication:722220
DOI10.1007/s00224-017-9822-5zbMath1436.03234DBLPjournals/mst/Moriakov18arXiv1701.06365OpenAlexW2580431628WikidataQ59481939 ScholiaQ59481939MaRDI QIDQ722220
Publication date: 23 July 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06365
Ergodic theorems, spectral theory, Markov operators (37A30) Theory of numerations, effectively presented structures (03D45) Algorithmic randomness and dimension (03D32)
Related Items (4)
Computable paradoxical decompositions ⋮ Fluctuation bounds for ergodic averages of amenable groups ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ On decidability of amenability in computable groups
Cites Work
- Unnamed Item
- Unnamed Item
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Entropy and isomorphism theorems for actions of amenable groups
- Pointwise theorems for amenable groups.
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Cellular Automata and Groups
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
- Croissance des boules et des géodésiques fermées dans les nilvariétés
- Operator Theoretic Aspects of Ergodic Theory
- Computable Algebra, General Theory and Theory of Computable Fields
- The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups
This page was built for publication: On effective Birkhoff's ergodic theorem for computable actions of amenable groups