Related papers: Majority-Vote Cellular Automata, Ising Dynamics, a…
A random boolean cellular automaton is a network of boolean gates where the inputs, the boolean function, and the initial state of each gate are chosen randomly. In this article, each gate has two inputs. Let $a$ (respectively $c$) be the…
The initial majority identification task is a fundamental test problem in cellular automaton research. To pass the test, an automaton must evolve to a uniform configuration consisting of the state that was in the majority for any initial…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the…
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition…
The voter model with memory-dependent dynamics is theoretically and numerically studied at the mean-field level. The `internal age', or time an individual spends holding the same state, is added to the set of binary states of the…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
In this article we create a new algorithm for the perfect simulation of the infinite Potts model at a sufficiently small or at a sufficiently high temperature, in particular under the transition phase temperature. We study the model for…
We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal…
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Cellular Automata (DECA), obtained as random mixture of two different Elementary Cellular Automata rules. All the cells are updated synchronously and…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
The conventional voter model is modified so that an agent's switching rate depends on the `age' of the agent, that is, the time since the agent last switched opinion. In contrast to previous work, age is continuous in the present model. We…
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We…
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…
We update a one-dimensional chain of Ising spins of length $L$ with algorithms which are parameterized by the probability $p$ for a certain site to get updated in one time step. The result of the update event itself is determined by the…
A new technique is demonstrated for carrying out exact positive-P phase-space simulations of the coherent Ising machine quantum computer. By suitable design of the coupling matrix, general hard optimization problems can be solved. Here,…