Computable symbolic dynamics

DOI10.1002/MALQ.200710066zbMATHOpenAlexMaRDI QIDQ3528142FDO

Authors Douglas Cenzer, S. Ali Dashti, 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

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

Recommendations

• Effective symbolic dynamics
• scientific article; zbMATH DE number 5117086
• Computability of countable subshifts
• Computability of countable subshifts in one dimension
• On the computability of the topological entropy of subshifts

Cites work

• scientific article; zbMATH DE number 5117086 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4039896 (Why is no real title available?)
• scientific article; zbMATH DE number 3718210 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1303200 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1390012 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• An Introduction to Symbolic Dynamics and Coding
• Computing over the reals: foundations for scientific computing.
• Effectively closed sets and enumerations
• Effectively closed sets and graphs of computable real functions.
• Grammatical Complexity and One-Dimensional Dynamical Systems
• 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

Cited in

(26)

• Computability and the morphological complexity of some dynamics on continuous domains
• SYMBOLIC DYNAMICS GENERATED BY A COMBINATION OF GRAPHS
• Symbolic dynamics and finite automata
• FROM SYMBOLIC DYNAMICS TO A DIGITAL APPROACH
• scientific article; zbMATH DE number 5117086 (Why is no real title available?)
• Turing degrees of multidimensional SFTs
• Finitely presented expansions of groups, semigroups, and algebras
• Computability of countable subshifts in one dimension
• Cototal enumeration degrees and their applications to effective mathematics
• Finitely presented expansions of computably enumerable semigroups
• scientific article; zbMATH DE number 970131 (Why is no real title available?)
• Conservatively approximable functions
• scientific article; zbMATH DE number 852189 (Why is no real title available?)
• $\it \Pi^0_1$ Sets and Tilings
• Effective symbolic dynamics
• Computability in Symbolic Dynamics
• Computability of countable subshifts
• Symbolic Dynamics, Flower Automata and Infinite Traces
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Turing degree spectra of minimal subshifts
• Symbolic dynamics and characterization of complexity
• Dynamical aspects of \(\sigma\)-machines
• About the domino problem for subshifts on groups
• Medvedev degrees of two-dimensional subshifts of finite type
• Mathematical Foundations of Computer Science 2005
• Dynamics and computation in functional shifts

This page was built for publication: Computable symbolic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528142)