On the computability of the topological entropy of subshifts
From MaRDI portal
(Redirected from Publication:5387668)
Recommendations
Cited in
(26)- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- Topological entropy of a class of subshifts of finite type
- Effect of quantified irreducibility on the computability of subshift entropy
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
- Exploring the topological entropy of formal languages
- Topological entropy of formal languages
- Observation of nonlinear systems via finite capacity channels: constructive data rate limits
- Computability of the entropy of one-tape Turing machines
- The topologies of sofic subshifts have computable Pierce invariants
- Computability theoretic properties of the entropy of gap shifts
- Computability of topological pressure for sofic shifts with applications in statistical physics
- Computable symbolic dynamics
- Shifts with decidable language and non-computable entropy
- Computability of countable subshifts
- Chains, entropy, coding
- Effective symbolic dynamics
- Computing the topological entropy of shifts
- Computability of topological pressure on compact shift spaces beyond finite type*
- Regular language distance and entropy
- Computability at zero temperature
- Computing the topological entropy of shifts
- On computing the topological entropy of one-sided cellular automata
- Beta-shifts, their languages, and computability
- Computability of entropy and information in classical Hamiltonian systems
- Computability of countable subshifts in one dimension
- A characterization of the entropies of multidimensional shifts of finite type
This page was built for publication: On the computability of the topological entropy of subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387668)
