scientific article; zbMATH DE number 5117086
From MaRDI portal
Publication:3416092
Recommendations
- Machines, Computations, and Universality
- Computability in Symbolic Dynamics
- Computable symbolic dynamics
- Symbolic dynamics and finite automata
- On decision problems for substitutions in symbolic dynamics
- scientific article; zbMATH DE number 2079138
- On the dynamics and recursive properties of multidimensional symbolic systems
- scientific article; zbMATH DE number 837785
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
- Constructing dynamical systems with specified symbolic dynamics
Cited in
(21)- On the dynamics and recursive properties of multidimensional symbolic systems
- Undecidability and chaos in word-coded symbolic dynamics
- Universal computation and physical dynamics
- A one-dimensional physically universal cellular automaton
- The mirage of universality in cellular automata
- Decidability and universality of quasiminimal subshifts
- Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set
- Computability and dynamical systems
- The group of reversible Turing machines
- Computable symbolic dynamics
- Unpredictability and undecidability in dynamical systems
- Cototal enumeration degrees and their applications to effective mathematics
- Effective symbolic dynamics
- A universal cellular automaton without sensitive subsystems
- Machines, Computations, and Universality
- Freezing, bounded-change and convergent cellular automata
- Logical Approaches to Computational Barriers
- Simulation limitations of affine cellular automata
- The group of reversible Turing machines: subgroups, generators, and computability
- Computability of countable subshifts in one dimension
- A note on universality in multidimensional symbolic dynamics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416092)
