Mathematics – Dynamical Systems
Scientific paper
2007-03-07
Mathematics
Dynamical Systems
27 pages, 2 figures
Scientific paper
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.
Hochman Michael
Meyerovitch Tom
No associations
LandOfFree
A Characterization of the Entropies of Multidimensional Shifts of Finite Type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Characterization of the Entropies of Multidimensional Shifts of Finite Type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Characterization of the Entropies of Multidimensional Shifts of Finite Type will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-642746