Shifts with decidable language and non-computable entropy

MaRDI QIDQ3575432zbMATHFDO

Authors Christoph Spandl, P. H. Hertling

Publication date 27 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/640/0.html

zbMATH Keywords

topological entropycomputabilityshift spacescomputable real numberslanguage of a shift spaceright computable real numbers

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Symbolic dynamics (37B10) Topological entropy (37B40) Constructive and recursive analysis (03F60)

Recommendations

• On the computability of the topological entropy of subshifts
• Effect of quantified irreducibility on the computability of subshift entropy
• Computability theoretic properties of the entropy of gap shifts
• Computing the topological entropy of shifts
• Computing the topological entropy of shifts

Cited in

(19)

• On the computability of rotation sets and their entropies
• Computability of topological pressure for shifts of finite type with applications in statistical physics
• Computability at zero temperature
• The relationship between word complexity and computational complexity in subshifts
• Computing the topological entropy of shifts
• Computability theoretic properties of the entropy of gap shifts
• Some remarks on real numbers induced by first-order spectra
• Robust non-computability of dynamical systems and computability of robust dynamical systems
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Two notes on subshifts
• Computability and dynamical systems
• Entropy of subordinate shift spaces
• On the computability of the topological entropy of subshifts
• Effect of quantified irreducibility on the computability of subshift entropy
• Computability of topological pressure on compact shift spaces beyond finite type*
• Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
• Beta-shifts, their languages, and computability
• Mathematical Foundations of Computer Science 2005
• Computing the topological entropy of shifts

This page was built for publication: Shifts with decidable language and non-computable entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575432)