Effect of quantified irreducibility on the computability of subshift entropy
From MaRDI portal
Publication:1737069
DOI10.3934/dcds.2019083zbMath1408.37028arXiv1602.06166OpenAlexW2962783126WikidataQ128549595 ScholiaQ128549595MaRDI QIDQ1737069
Benjamin Hellouin de Menibus, Silvère Gangloff
Publication date: 26 March 2019
Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.06166
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Topological entropy (37B40) Symbolic dynamics (37B10)
Related Items
Computability of topological entropy: from general systems to transformations on Cantor sets and the interval, Computability of topological pressure on compact shift spaces beyond finite type*, Parametrization by horizontal constraints in the study of algorithmic properties of \(\mathbb{Z}^2\)-subshifts of finite type, Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
- Approximating the hard square entropy constant with probabilistic methods
- A characterization of the entropies of multidimensional shifts of finite type
- On the dynamics and recursive properties of multidimensional symbolic systems
- On computing the entropy of cellular automata.
- On entropy and monotonicity for real cubic maps (with an appendix by Adrien Douady and Pierrette Sentenac)
- Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
- Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type
- Bounded density shifts
- Densities and Entropies in Cellular Automata
- Computability of the entropy of one-tape Turing Machines
- The entropies of topological Markov shifts and a related class of algebraic integers
- The topological entropy of cellular automata is uncomputable
- Computing the topological entropy of shifts
