6,165 research outputs found
A linear speed-up theorem for cellular automata
AbstractIbarra (1985) showed that, given a cellular automaton of range 1 recognizing some language in time n+1+R(n), we can obtain another CA of range 1 recognizing exactly the same language but in time n+1+R(n)/k (k⩾2 arbitrary). Their proof proceeds indirectly (through the simulation of CAs by a special kind of sequential machines, the STMs) and we think it misses that way some of the deep intuition of the problem. We, therefore, provide here a direct proof of this result (extended to the case of CAs of arbitrary range) involving the explicit construction of a CA working in time n+1+R(n)/k. This speeded-up automaton first gathers the cells of the line k by k in n+1 steps which then enables it to start computing by “leaps” of k steps, thus completing the R(n) remaining steps in time R(n)/k. The major problem arising from the obligation to pass from one phase to the other synchronously is solved using a synchronization process derived from the solutions of the well-known “firing-squad synchronization problem” (FSSP)
Defect Particle Kinematics in One-Dimensional Cellular Automata
Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A,
and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous,
sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a
closed, (Phi,sigma)-invariant subset X of A^Z. Suppose x is a sequence in A^Z
which is X-admissible everywhere except for some small region we call a
`defect'. It has been empirically observed that such defects persist under
iteration of Phi, and often propagate like `particles'. We characterize the
motion of these particles, and show that it falls into several regimes, ranging
from simple deterministic motion, to generalized random walks, to complex
motion emulating Turing machines or pushdown automata. One consequence is that
some questions about defect behaviour are formally undecidable.Comment: 37 pages, 9 figures, 3 table
Bounded Languages Meet Cellular Automata with Sparse Communication
Cellular automata are one-dimensional arrays of interconnected interacting
finite automata. We investigate one of the weakest classes, the real-time
one-way cellular automata, and impose an additional restriction on their
inter-cell communication by bounding the number of allowed uses of the links
between cells. Moreover, we consider the devices as acceptors for bounded
languages in order to explore the borderline at which non-trivial decidability
problems of cellular automata classes become decidable. It is shown that even
devices with drastically reduced communication, that is, each two neighboring
cells may communicate only constantly often, accept bounded languages that are
not semilinear. If the number of communications is at least logarithmic in the
length of the input, several problems are undecidable. The same result is
obtained for classes where the total number of communications during a
computation is linearly bounded
Intrinsically universal one-dimensional quantum cellular automata in two flavours
We give a one-dimensional quantum cellular automaton (QCA) capable of
simulating all others. By this we mean that the initial configuration and the
local transition rule of any one-dimensional QCA can be encoded within the
initial configuration of the universal QCA. Several steps of the universal QCA
will then correspond to one step of the simulated QCA. The simulation preserves
the topology in the sense that each cell of the simulated QCA is encoded as a
group of adjacent cells in the universal QCA. The encoding is linear and hence
does not carry any of the cost of the computation. We do this in two flavours:
a weak one which requires an infinite but periodic initial configuration and a
strong one which needs only a finite initial configuration. KEYWORDS: Quantum
cellular automata, Intrinsic universality, Quantum computation.Comment: 27 pages, revtex, 23 figures. V3: The results of V1-V2 are better
explained and formalized, and a novel result about intrinsic universality
with only finite initial configurations is give
Directional Dynamics along Arbitrary Curves in Cellular Automata
This paper studies directional dynamics in cellular automata, a formalism
previously introduced by the third author. The central idea is to study the
dynamical behaviour of a cellular automaton through the conjoint action of its
global rule (temporal action) and the shift map (spacial action): qualitative
behaviours inherited from topological dynamics (equicontinuity, sensitivity,
expansivity) are thus considered along arbitrary curves in space-time. The main
contributions of the paper concern equicontinuous dynamics which can be
connected to the notion of consequences of a word. We show that there is a
cellular automaton with an equicontinuous dynamics along a parabola, but which
is sensitive along any linear direction. We also show that real numbers that
occur as the slope of a limit linear direction with equicontinuous dynamics in
some cellular automaton are exactly the computably enumerable numbers
Quantum Causal Graph Dynamics
Consider a graph having quantum systems lying at each node. Suppose that the
whole thing evolves in discrete time steps, according to a global, unitary
causal operator. By causal we mean that information can only propagate at a
bounded speed, with respect to the distance given by the graph. Suppose,
moreover, that the graph itself is subject to the evolution, and may be driven
to be in a quantum superposition of graphs---in accordance to the superposition
principle. We show that these unitary causal operators must decompose as a
finite-depth circuit of local unitary gates. This unifies a result on Quantum
Cellular Automata with another on Reversible Causal Graph Dynamics. Along the
way we formalize a notion of causality which is valid in the context of quantum
superpositions of time-varying graphs, and has a number of good properties.
Keywords: Quantum Lattice Gas Automata, Block-representation,
Curtis-Hedlund-Lyndon, No-signalling, Localizability, Quantum Gravity, Quantum
Graphity, Causal Dynamical Triangulations, Spin Networks, Dynamical networks,
Graph Rewriting.Comment: 8 pages, 1 figur
Recommended from our members
Layered cellular automata for pseudorandom number generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used
On a zero speed sensitive cellular automaton
Using an unusual, yet natural invariant measure we show that there exists a
sensitive cellular automaton whose perturbations propagate at asymptotically
null speed for almost all configurations. More specifically, we prove that
Lyapunov Exponents measuring pointwise or average linear speeds of the faster
perturbations are equal to zero. We show that this implies the nullity of the
measurable entropy. The measure m we consider gives the m-expansiveness
property to the automaton. It is constructed with respect to a factor dynamical
system based on simple "counter dynamics". As a counterpart, we prove that in
the case of positively expansive automata, the perturbations move at positive
linear speed over all the configurations
- …