Computable symbolic dynamics

DOI10.1002/malq.200710066zbMath1170.03029OpenAlexW2030543060MaRDI 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 dynamicscomputabilitycomputable closed sets

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Symbolic dynamics (37B10) Applications of computability and recursion theory (03D80) Constructive real analysis (26E40)

Related Items (10)

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

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

This page was built for publication: Computable symbolic dynamics