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\geq0$ 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 strongly irreducible SFTs is computable.
Michael Hochman  1 ; Tom Meyerovitch  2
@article{10_4007_annals_2010_171_2011,
author = {Michael Hochman and Tom Meyerovitch},
title = {A characterization of the entropies of multidimensional shifts of finite type},
journal = {Annals of mathematics},
pages = {2011--2038},
year = {2010},
volume = {171},
number = {3},
doi = {10.4007/annals.2010.171.2011},
mrnumber = {2680402},
zbl = {1192.37022},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2010.171.2011/}
}
TY - JOUR AU - Michael Hochman AU - Tom Meyerovitch TI - A characterization of the entropies of multidimensional shifts of finite type JO - Annals of mathematics PY - 2010 SP - 2011 EP - 2038 VL - 171 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4007/annals.2010.171.2011/ DO - 10.4007/annals.2010.171.2011 LA - en ID - 10_4007_annals_2010_171_2011 ER -
%0 Journal Article %A Michael Hochman %A Tom Meyerovitch %T A characterization of the entropies of multidimensional shifts of finite type %J Annals of mathematics %D 2010 %P 2011-2038 %V 171 %N 3 %U http://geodesic.mathdoc.fr/articles/10.4007/annals.2010.171.2011/ %R 10.4007/annals.2010.171.2011 %G en %F 10_4007_annals_2010_171_2011
Michael Hochman; Tom Meyerovitch. A characterization of the entropies of multidimensional shifts of finite type. Annals of mathematics, Tome 171 (2010) no. 3, pp. 2011-2038. doi: 10.4007/annals.2010.171.2011
Cité par Sources :