Computing the topological entropy of shifts

DOI10.1002/malq.200710014zbMath1120.37007OpenAlexW2140692608MaRDI QIDQ5307614

Christoph Spandl

Publication date: 17 September 2007

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710014

zbMATH Keywords

labeled digraphstype-2 computabilityshift dynamical systems

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Topological entropy (37B40) Symbolic dynamics (37B10)

Related Items (11)

Computability and Dynamical Systems ⋮ 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* ⋮ Computations on sofic \(S\)-gap shifts ⋮ Dynamics and topology of \(S\)-gap shifts ⋮ Follower, predecessor, and extender entropies ⋮ Effect of quantified irreducibility on the computability of subshift entropy ⋮ Computability, noncomputability, and hyperbolic systems ⋮ Extender sets and measures of maximal entropy for subshifts ⋮ Dynamics and entropy of \(\mathcal{S}\)-graph shifts ⋮ Dynamical properties of \(S\)-gap shifts and other shift spaces

Cites Work

• Unnamed Item
• The computational complexity of some julia sets
• Chains, entropy, coding

This page was built for publication: Computing the topological entropy of shifts