Computable Følner monotilings and a theorem of Brudno

DOI10.1017/etds.2020.110zbMath1486.37009arXiv1509.07858OpenAlexW3099610359WikidataQ114119395 ScholiaQ114119395MaRDI QIDQ5156795

Nikita Moriakov

Publication date: 12 October 2021

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.07858

zbMATH Keywords

entropyKolmogorov complexitymeasure-preserving dynamical systems

Mathematics Subject Classification ID

Dynamical aspects of measure-preserving transformations (37A05) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Symbolic dynamics (37B10) Multidimensional shifts of finite type (37B51)

Related Items (4)

Fiber entropy and algorithmic complexity of random orbits ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ An announce of results linking Kolmogorov complexity to entropy for amenable group actions ⋮ Measurable versions of the Lovász local lemma and measurable graph colorings

Cites Work

• Return times theorem for amenable groups
• A Banach space-valued ergodic theorem and the uniform approximation of the integrated density of states
• Pointwise theorems for amenable groups.
• Topological invariants of dynamical systems and spaces of holomorphic maps. I.
• An announce of results linking Kolmogorov complexity to entropy for amenable group actions
• Symbolic dynamics: entropy = dimension = complexity
• Cellular Automata and Groups
• On the entropy theory of finitely-generated nilpotent group actions
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable Følner monotilings and a theorem of Brudno