arXiv · math/0703206
A Characterization of the Entropies of Multidimensional Shifts of Finite Type
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 $h\geq 0$ 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.
Explore related subjects
Keep this discovery
Michael Hochman, Tom Meyerovitch. 2007-03-07. A Characterization of the Entropies of Multidimensional Shifts of Finite Type. https://doi.org/10.4007/annals.2010.171.2011
Cite the original work for its findings. Save a collection to share your selection of sources.