Related papers: Evolution of natural patterns from random fields
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their neighbors. Its trace is the set of infinite words representing…
Recent studies of in vitro evolution of DNA via protein binding indicate that the evolution behavior is qualitatively different in different parameter regimes. I here present a general theory that is valid for a wide range of parameters,…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we…
A kinetic description of lattice-gas automaton models for reaction-diffusion systems is presented. It provides corrections to the mean-field rate equations in the diffusion-limited regime. When applied to the two-species Maginu model, the…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
This paper introduces Differentiable Logic Cellular Automata (DiffLogic CA), a novel combination of Neural Cellular Automata (NCA) and Differentiable Logic Gates Networks (DLGNs). The fundamental computation units of the model are…
The theory of interaction-based evolution argues that, at the most basic level of analysis, there is a third alternative for how adaptive evolution works besides a) accidental mutation and natural selection and b) Lamarckism, namely, c)…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Cellular automata are computers, similar to Turing machines. The main difference is that Turing machines use a one-dimensional tape, whereas cellular automata use a two-dimensional grid. The best-known cellular automaton is the Game of…
The emergent dynamics in spacetime diagrams of cellular automata (CAs) is often organised by means of a number of behavioural classes. Whilst classification of elementary CAs is feasible and well-studied, non-elementary CAs are generally…
Cellular automata (CA) are well-studied models of decentralized parallel computation, known for their ability to exhibit complex global behavior from simple local rules. While their dynamics have been widely explored through simulations, a…
We turn high energy elastic scattering of hadrons into an initial value problem using an evolution equation based on the Regge Field Theory, which has a form of the complex nonlinear reaction-diffusion equation, with time being played by…
A theoretical study of cell evolution is presented here. By using a toolbox containing an intracellular catalytic reaction network model and a mutation-selection process, four distinct phases of self-organization were unveiled. First, the…
We introduce a stochastic cellular automaton as a model for culture and border formation. The model can be conceptualized as a game where the expansion rate of cultures is quantified in terms of their area and perimeter in such a way that…
Models relating to the Species-Area curve are usually defined at the species level, and concerned only with ecological timescales. We examine an individual-based model of co-evolution on a spatial lattice based on the Tangled Nature model,…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
In his seminal paper on morphogenesis (1952), Alan Turing demonstrated that different spatio-temporal patterns can arise due to instability of the homogeneous state in reaction-diffusion systems, but at least two species are necessary to…