Shifts with decidable language and non-computable entropy
From MaRDI portal
Publication:3575432
zbMATH Open1204.37013MaRDI QIDQ3575432FDOQ3575432
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
Recommendations
topological entropycomputabilityshift spacescomputable real numberslanguage of a shift spaceright computable real numbers
Computation over the reals, computable analysis (03D78) Symbolic dynamics (37B10) Topological entropy (37B40) Constructive and recursive analysis (03F60)
Cited In (19)
- Two notes on subshifts
- The relationship between word complexity and computational complexity in subshifts
- Computing the topological entropy of shifts
- Effect of quantified irreducibility on the computability of subshift entropy
- Computability of topological pressure for shifts of finite type with applications in statistical physics
- Computability of topological pressure on compact shift spaces beyond finite type*
- Computability at zero temperature
- Robust non-computability of dynamical systems and computability of robust dynamical systems
- Some remarks on real numbers induced by first-order spectra
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
- On the computability of the topological entropy of subshifts
- Mathematical Foundations of Computer Science 2005
- Beta-shifts, their languages, and computability
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- Computability and dynamical systems
- On the computability of rotation sets and their entropies
- Computability theoretic properties of the entropy of gap shifts
- Entropy of subordinate shift spaces
- 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)
