Cold dynamics in cellular automata: a tutorial
From MaRDI portal
Publication:6137192
DOI10.1007/s11047-022-09886-2zbMath1530.37033arXiv2206.08139MaRDI QIDQ6137192
Publication date: 1 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.08139
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Simple dynamics on graphs
- The complexity of the bootstraping percolation and other problems
- On time-symmetry in cellular automata
- A uniquely ergodic cellular automaton
- Around probabilistic cellular automata
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- Computability and complexity in self-assembly
- Directional dynamics along arbitrary curves in cellular automata
- A non-ergodic probabilistic cellular automaton with a unique invariant measure
- Gardens of Eden and amenability on cellular automata
- Reversible computing and cellular automata -- a survey
- Maximum number of fixed points in regulatory Boolean networks
- Oriented percolation in two dimensions
- Decreasing energy functions as a tool for studying threshold networks
- On the concept of attractor
- An equilibrium state for a one-dimensional life game
- Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Counter machines and distributed automata -- a story about exchanging space and time
- Characterisation of limit measures of higher-dimensional cellular automata
- Strict asymptotic nilpotency in cellular automata
- Cellular automata with sparse communication
- Proof of Straley's argument for bootstrap percolation.
- Lattice-gas cellular automata and lattice Boltzmann models. An introduction
- The majority action on infinite graphs: Strings and puppets
- 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
- On the impact of treewidth in the computational complexity of freezing dynamics
- No Tits alternative for cellular automata
- Bootstrap percolation, and other automata
- Ergodicity of some classes of cellular automata subject to noise
- Cellular automata and bootstrap percolation
- Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions
- On the Limit Sets of Cellular Automata
- Cellular Automata and Groups
- Nilpotency and Limit Sets of Cellular Automata
- The Automorphism Group of a Shift of Finite Type
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Linear sampling and the ∀∃∀ case of the decision problem
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
- An Introduction to Symbolic Dynamics and Coding
- Cellular Automata Modeling of Physical Systems
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
- On Nilpotency and Asymptotic Nilpotency of Cellular Automata
- Nilpotent endomorphisms of expansive group actions
- The generic limit set of cellular automata
- The program-size complexity of self-assembled paths
- Characterizing asymptotic randomization in abelian cellular automata
- Monotone cellular automata
- Monotone Cellular Automata in a Random Environment
- Endomorphisms and automorphisms of the shift dynamical system
- A logical calculus of the ideas immanent in nervous activity
- Freezing, Bounded-Change and Convergent Cellular Automata
- Limit sets of cellular automata associated to probability measures
- Reliable cellular automata with self-organization
- On the influence of the interaction graph on a finite dynamical system
- Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata
- Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models
