An announce of results linking Kolmogorov complexity to entropy for amenable group actions

DOI10.1007/S10958-019-04367-XzbMath1439.37032OpenAlexW2954937605WikidataQ127616437 ScholiaQ127616437MaRDI QIDQ2307955

A. V. Alpeev

Publication date: 25 March 2020

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-019-04367-x

zbMATH Keywords

entropyKolmogorov complexitycomputable amenable groupssubshift for actions

Mathematics Subject Classification ID

Ergodic theory on groups (22D40) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Dynamics induced by group actions other than (mathbb{Z}) and (mathbb{R}), and (mathbb{C}) (37C85) Measures of information, entropy (94A17) Symbolic dynamics (37B10) Measurable group actions (22F10)

Related Items (2)

Fiber entropy and algorithmic complexity of random orbits ⋮ Computable Følner monotilings and a theorem of Brudno

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measurable versions of the Lovász local lemma and measurable graph colorings
• Symbolic dynamics: entropy = dimension = complexity
• Computable Følner monotilings and a theorem of Brudno
• Ergodic Theory

This page was built for publication: An announce of results linking Kolmogorov complexity to entropy for amenable group actions