Cold dynamics in cellular automata: a tutorial
From MaRDI portal
(Redirected from Publication:6137192)
Abstract: This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many examples from the literature. A rich zoo of properties is presented and discussed: nilpotency and asymptotic, generic or mu-variants, unique ergodicity, convergence, bounded-changeness, freezingness. They all correspond to the 'cold dynamics' paradigm in some way, and we study their links and differences by various examples and results from the literature. Besides dynamical considerations, we also focus on computational aspects: we show how such 'cold cellular automata' can still compute under their dynamical constraint, and what are their computational limitation.
Recommendations
Cites work
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- A logical calculus of the ideas immanent in nervous activity
- A non-ergodic probabilistic cellular automaton with a unique invariant measure
- A uniquely ergodic cellular automaton
- An equilibrium state for a one-dimensional life game
- An Introduction to Symbolic Dynamics and Coding
- An introduction to tile-based self-assembly and a survey of recent results
- Around probabilistic cellular automata
- Bootstrap percolation, and other automata
- Cellular automata and bootstrap percolation
- Cellular automata and groups
- Cellular Automata Modeling of Physical Systems
- Cellular automata with sparse communication
- Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
- Characterisation of limit measures of higher-dimensional cellular automata
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- Characterizing asymptotic randomization in abelian cellular automata
- Computability and complexity in self-assembly
- Counter machines and distributed automata -- a story about exchanging space and time
- Decreasing energy functions as a tool for studying threshold networks
- Directional dynamics along arbitrary curves in cellular automata
- Endomorphisms and automorphisms of the shift dynamical system
- Ergodicity of some classes of cellular automata subject to noise
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Freezing, bounded-change and convergent cellular automata
- Gardens of Eden and amenability on cellular automata
- scientific article; zbMATH DE number 3896305 (Why is no real title available?)
- scientific article; zbMATH DE number 4042465 (Why is no real title available?)
- scientific article; zbMATH DE number 4070371 (Why is no real title available?)
- scientific article; zbMATH DE number 3688721 (Why is no real title available?)
- scientific article; zbMATH DE number 3718546 (Why is no real title available?)
- scientific article; zbMATH DE number 45557 (Why is no real title available?)
- scientific article; zbMATH DE number 1241089 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- scientific article; zbMATH DE number 1361468 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3382226 (Why is no real title available?)
- Lattice-gas cellular automata and lattice Boltzmann models. An introduction
- Limit sets of cellular automata associated to probability measures
- Linear sampling and the ∀∃∀ case of the decision problem
- Maximum number of fixed points in regulatory Boolean networks
- Monotone cellular automata
- Monotone cellular automata in a random environment
- Nilpotency and Limit Sets of Cellular Automata
- Nilpotent endomorphisms of expansive group actions
- No Tits alternative for cellular automata
- On Nilpotency and Asymptotic Nilpotency of Cellular Automata
- On the concept of attractor
- On the impact of treewidth in the computational complexity of freezing dynamics
- On the influence of the interaction graph on a finite dynamical system
- On the Limit Sets of Cellular Automata
- On time-symmetry in cellular automata
- Oriented percolation in two dimensions
- Proof of Straley's argument for bootstrap percolation.
- Reliable cellular automata with self-organization
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
- Reversible computing and cellular automata -- a survey
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Simple dynamics on graphs
- Strict asymptotic nilpotency in cellular automata
- Subcritical \(\mathcal{U}\)-bootstrap percolation models have non-trivial phase transitions
- Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017
- Surjective cellular automata far from the Garden of Eden
- The Automorphism Group of a Shift of Finite Type
- The complexity of the bootstraping percolation and other problems
- The generic limit set of cellular automata
- The majority action on infinite graphs: Strings and puppets
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
- The program-size complexity of self-assembled paths
This page was built for publication: Cold dynamics in cellular automata: a tutorial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137192)
