A characterization of the entropies of multidimensional shifts of finite type

From MaRDI portal
Publication:974081

DOI10.4007/ANNALS.2010.171.2011zbMATH Open1192.37022arXivmath/0703206OpenAlexW3098115869MaRDI QIDQ974081FDOQ974081

Michael Hochman, Tom Meyerovitch

Publication date: 27 May 2010

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Abstract: We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number hgeq0 is the entropy of such an SFT if and only if it is right recursively enumerable, i.e. there is a computable sequence of rational numbers converging to h from above. The same characterization holds for the entropies of sofic shifts. On the other hand, the entropy of an irreducible SFT is computable.


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




Recommendations




Cites Work


Cited In (80)





This page was built for publication: A characterization of the entropies of multidimensional shifts of finite type

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974081)