Topological entropy of a class of subshifts of finite type (Q1633858)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6996492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Topological entropy of a class of subshifts of finite type |
scientific article; zbMATH DE number 6996492 |
Statements
Topological entropy of a class of subshifts of finite type (English)
0 references
21 December 2018
0 references
The entropy of a higher-dimensional shift of finite type is known to be uncomputable in general, in the sense that an entropy-calculating algorithm could be used as a component of an algorithm which would solve the halting problem for Turing machines, by work of \textit{L. P. Hurd} et al. [Ergodic Theory Dyn. Syst. 12, No. 2, 255--265 (1992; Zbl 0770.58017)]. Here a special class of shifts of finite type are described for which the topological entropy can be estimated, and the asymptotic value (the class is parameterized) is computed explicitly.
0 references
symbolic dynamical system
0 references
subshift of finite type
0 references
topological entropy
0 references
transfer matrix
0 references
Toeplitz matrix
0 references
0.8526351451873779
0 references
0.8381034135818481
0 references
0.8301476240158081
0 references
0.8292848467826843
0 references
0.828104555606842
0 references
