Computable symbolic dynamics

DOI10.1002/MALQ.200710066zbMATH Open1170.03029OpenAlexW2030543060MaRDI QIDQ3528142FDOQ3528142

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

Recommendations

• Effective symbolic dynamics
• scientific article
• Computability of countable subshifts
• Computability of countable subshifts in one dimension
• On the computability of the topological entropy of subshifts

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)

Cites Work

• An Introduction to Symbolic Dynamics and Coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The computational complexity of some Julia sets
• On finite limit sets for transformations on the unit interval
• On the definitions of computable real continuous functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effectively closed sets and enumerations
• Computing over the reals: foundations for scientific computing.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammatical Complexity and One-Dimensional Dynamical Systems
• Effectively closed sets and graphs of computable real functions.

Cited In (24)

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

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)