The following pages link to (Q3416092):
Displaying 20 items.
- Computability of countable subshifts in one dimension (Q693067) (← links)
- A note on universality in multidimensional symbolic dynamics (Q733816) (← links)
- On the dynamics and recursive properties of multidimensional symbolic systems (Q1016235) (← links)
- Undecidability and chaos in word-coded symbolic dynamics (Q1346778) (← links)
- Universal computation and physical dynamics (Q1896542) (← links)
- A one-dimensional physically universal cellular automaton (Q2011676) (← links)
- The mirage of universality in cellular automata (Q2086715) (← links)
- Decidability and universality of quasiminimal subshifts (Q2402365) (← links)
- Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set (Q2880675) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- The Group of Reversible Turing Machines (Q3186472) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- Unpredictability and undecidability in dynamical systems (Q4491788) (← links)
- Cototal enumeration degrees and their applications to effective mathematics (Q4563667) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- A Universal Cellular Automaton Without Sensitive Subsystems (Q5501612) (← links)
- Machines, Computations, and Universality (Q5710896) (← links)
- Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
- Logical Approaches to Computational Barriers (Q5898812) (← links)
- Simulation limitations of affine cellular automata (Q6549671) (← links)
