451 research outputs found
Quantum Cellular Automata
Quantum cellular automata (QCA) are reviewed, including early and more recent
proposals. QCA are a generalization of (classical) cellular automata (CA) and
in particular of reversible CA. The latter are reviewed shortly. An overview is
given over early attempts by various authors to define one-dimensional QCA.
These turned out to have serious shortcomings which are discussed as well.
Various proposals subsequently put forward by a number of authors for a general
definition of one- and higher-dimensional QCA are reviewed and their properties
such as universality and reversibility are discussed.Comment: 12 pages, 3 figures. To appear in the Springer Encyclopedia of
Complexity and Systems Scienc
The Kinetic Basis of Self-Organized Pattern Formation
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 produce even the simplest stationary patterns. This paper is aimed
to propose a novel model of the analog (continuous state) kinetic automaton and
to show that stationary and dynamic patterns can arise in one-component
networks of kinetic automata. Possible applicability of kinetic networks to
modeling of real-world phenomena is also discussed.Comment: 8 pages, submitted to the 14th International Conference on the
Synthesis and Simulation of Living Systems (Alife 14) on 23.03.2014, accepted
09.05.201
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
On Conservative and Monotone One-dimensional Cellular Automata and Their Particle Representation
Number-conserving (or {\em conservative}) cellular automata have been used in
several contexts, in particular traffic models, where it is natural to think
about them as systems of interacting particles. In this article we consider
several issues concerning one-dimensional cellular automata which are
conservative, monotone (specially ``non-increasing''), or that allow a weaker
kind of conservative dynamics. We introduce a formalism of ``particle
automata'', and discuss several properties that they may exhibit, some of
which, like anticipation and momentum preservation, happen to be intrinsic to
the conservative CA they represent. For monotone CA we give a characterization,
and then show that they too are equivalent to the corresponding class of
particle automata. Finally, we show how to determine, for a given CA and a
given integer , whether its states admit a -neighborhood-dependent
relabelling whose sum is conserved by the CA iteration; this can be used to
uncover conservative principles and particle-like behavior underlying the
dynamics of some CA. Complements at {\tt http://www.dim.uchile.cl/\verb'
'anmoreir/ncca}Comment: 38 pages, 2 figures. To appear in Theo. Comp. Sc. Several changes
throughout the text; major change in section 4.
- …