Related papers: Coevolving Cellular Automata with Memory for Chemi…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
Cellular Automata (CA) theory is a discrete model that represents the state of each of its cells from a finite set of possible values which evolve in time according to a pre-defined set of transition rules. CA have been applied to a number…
Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
Most computer simulations of molecular dynamics take place under equilibrium conditions--in a closed, isolated system, or perhaps one held at constant temperature or pressure. Sometimes, extra tensions, shears, or temperature gradients are…
Cellular automata provide a fascinating class of dynamical systems capable of diverse complex behavior. These include simplified models for many phenomena seen in nature. Among other things, they provide insight into self-organized…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
The future fibre optic communications network will rely on photons as carriers of information, which may be stored in intensity, polarization or phase of light. However, processing of such optical information usually relies on electronics.…
The calcium transport in biological systems is modelled as a reaction-diffusion process. Nonlinear calcium waves are then simulated using a stochastic cellular automaton whose rules are derived from the corresponding coupled partial…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
The classical dynamical systems model of continuous stirred tank reactors (CSTR) in which a first order chemical reaction takes place is reformulated in terms of stochastic cellular automata by extending previous works of Seyborg (1997) and…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
High harmonic light sources make it possible to access attosecond time-scales, thus opening up the prospect of manipulating electronic wave packets for steering molecular dynamics. However, two decades after the birth of attosecond physics,…