Computable symbolic dynamics

DOI10.1002/malq.200710066zbMath1170.03029MaRDI QIDQ3528142

S. Ali Dashti, Douglas Cenzer, Jonathan L. King

Publication date: 8 October 2008

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

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

zbMATH Keywords

symbolic dynamics; computability; computable closed sets

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

37B10: Symbolic dynamics

03D80: Applications of computability and recursion theory

26E40: Constructive real analysis

Related Items

Cototal enumeration degrees and their applications to effective mathematics, About the Domino Problem for Subshifts on Groups, Finitely presented expansions of groups, semigroups, and algebras, Medvedev degrees of two-dimensional subshifts of finite type, Turing degrees of multidimensional SFTs, Computability of countable subshifts in one dimension, Finitely presented expansions of computably enumerable semigroups, Turing degree spectra of minimal subshifts, $\it \Pi^0_1$ Sets and Tilings, Computability in Symbolic Dynamics

Cites Work

• Effectively closed sets and enumerations
• Effectively closed sets and graphs of computable real functions.
• On finite limit sets for transformations on the unit interval
• On the definitions of computable real continuous functions
• The computational complexity of some julia sets
• An Introduction to Symbolic Dynamics and Coding
• Grammatical Complexity and One-Dimensional Dynamical Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item