4,148 research outputs found
Communication Complexity and Intrinsic Universality in Cellular Automata
The notions of universality and completeness are central in the theories of
computation and computational complexity. However, proving lower bounds and
necessary conditions remains hard in most of the cases. In this article, we
introduce necessary conditions for a cellular automaton to be "universal",
according to a precise notion of simulation, related both to the dynamics of
cellular automata and to their computational power. This notion of simulation
relies on simple operations of space-time rescaling and it is intrinsic to the
model of cellular automata. Intrinsinc universality, the derived notion, is
stronger than Turing universality, but more uniform, and easier to define and
study. Our approach builds upon the notion of communication complexity, which
was primarily designed to study parallel programs, and thus is, as we show in
this article, particulary well suited to the study of cellular automata: it
allowed to show, by studying natural problems on the dynamics of cellular
automata, that several classes of cellular automata, as well as many natural
(elementary) examples, could not be intrinsically universal
Computational Universality and 1/f Noise in Elementary Cellular Automata
It is speculated that there is a relationship between 1/f noise and
computational universality in cellular automata. We use genetic algorithms to
search for one-dimensional and two-state, five-neighbor cellular automata which
have 1/f-type spectrum. A power spectrum is calculated from the evolution
starting from a random initial configuration. The fitness is estimated from the
power spectrum in consideration of the similarity to 1/f-type spectrum. The
result shows that the rule with the highest average fitness has a propagating
structure like other computationally universal cellular automata, although
computational universality of the rule has not been proved yet
Renormalization group of probabilistic cellular automata with one absorbing state
We apply a recently proposed dynamically driven renormalization group scheme
to probabilistic cellular automata having one absorbing state. We have found
just one unstable fixed point with one relevant direction. In the limit of
small transition probability one of the cellular automata reduces to the
contact process revealing that the cellular automata are in the same
universality class as that process, as expected. Better numerical results are
obtained as the approximations for the stationary distribution are improved.Comment: Errors in some formulas have been corrected. Additional material
available at http://mestre.if.usp.br/~javie
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is
central in symbolic dynamics. Besides, a notion of intrinsic universality for
cellular automata based on an operation of rescaling is receiving more and more
attention in the literature. In this paper, we propose to study the factoring
relation up to rescalings, and ask for the existence of universal objects for
that simulation relation. In classical simulations of a system S by a system T,
the simulation takes place on a specific subset of configurations of T
depending on S (this is the case for intrinsic universality). Our setting,
however, asks for every configurations of T to have a meaningful interpretation
in S. Despite this strong requirement, we show that there exists a cellular
automaton able to simulate any other in a large class containing arbitrarily
complex ones. We also consider the case of subshifts and, using arguments from
recursion theory, we give negative results about the existence of universal
objects in some classes
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
Cellular Automata and Randomization: A Structural Overview
The chapter overviews the methods, algorithms, and architectures for random number generators based on cellular automata, as presented in the scientific literature. The variations in linear and two-dimensional cellular automata model and their features are discussed in relation to their applications as randomizers. Additional memory layers, functional nonuniformity in space or time, and global feedback are examples of such variations. Successful applications of cellular automata random number/signal generators (both software and hardware) reported in the scientific literature are also reviewed. The chapter includes an introductory presentation of the mathematical (ideal) model of cellular automata and its implementation as a computing model, emphasizing some important theoretical debates regarding the complexity and universality of cellular automata
Universalities in cellular automata; a (short) survey
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is organized in three parts: a detailled chronology of seminal papers, a discussion of the definition and main properties of universal cellular automata, and a broad bibliography
A Full Computation-relevant Topological Dynamics Classification of Elementary Cellular Automata
Cellular automata are both computational and dynamical systems. We give a
complete classification of the dynamic behaviour of elementary cellular
automata (ECA) in terms of fundamental dynamic system notions such as
sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not
chaotic and not eventually weakly periodic. Based on this classification, we
conjecture that elementary cellular automata capable of carrying out complex
computations, such as needed for Turing-universality, are at the "edge of
chaos"
Synchronization of Coupled Systems with Spatiotemporal Chaos
We argue that the synchronization transition of stochastically coupled
cellular automata, discovered recently by L.G. Morelli {\it et al.} (Phys. Rev.
{\bf 58 E}, R8 (1998)), is generically in the directed percolation universality
class. In particular, this holds numerically for the specific example studied
by these authors, in contrast to their claim. For real-valued systems with
spatiotemporal chaos such as coupled map lattices, we claim that the
synchronization transition is generically in the universality class of the
Kardar-Parisi-Zhang equation with a nonlinear growth limiting term.Comment: 4 pages, including 3 figures; submitted to Phys. Rev.
- …