Shifts with decidable language and non-computable entropy
From MaRDI portal
(Redirected from Publication:3575432)
Recommendations
Cited in
(20)- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- Effect of quantified irreducibility on the computability of subshift entropy
- The relationship between word complexity and computational complexity in subshifts
- Computability and dynamical systems
- Some remarks on real numbers induced by first-order spectra
- Computability theoretic properties of the entropy of gap shifts
- Entropy of subordinate shift spaces
- Computability of topological pressure for shifts of finite type with applications in statistical physics
- Computing the topological entropy of shifts
- Computability of topological pressure on compact shift spaces beyond finite type*
- A characterization of subshifts with computable language
- Computability at zero temperature
- On the computability of rotation sets and their entropies
- Computing the topological entropy of shifts
- On the computability of the topological entropy of subshifts
- Two notes on subshifts
- Mathematical Foundations of Computer Science 2005
- Beta-shifts, their languages, and computability
- Robust non-computability of dynamical systems and computability of robust dynamical systems
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
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)
