Related papers: A One-Dimensional Physically Universal Cellular Au…
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
We develop a rather elaborate computer program to investigate the jointly periodic points of one-dimensional cellular automata. The experimental results and mathematical context lead to questions, conjectures and a contextual theorem.
A new paradigm for the unification of physics is described. It is called Cellular Automata (CA) theory, which is the most massively parallel computer model currently known to science. We maintain that at the tiniest distance and time scales…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
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…
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…
We describe a physical implementation of a quantum finite automaton recognizing a well known family of periodic languages. The realization exploits the polarization degree of freedom of single photons and their manipulation through linear…
In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane and we consider the global function defined on all possible configurations. Is the injectivity of this function undecidable? The problem…
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…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
We derive a class of cellular automata for the Schr\"odinger Hamiltonian, including scalar and vector potentials. It is based on a multi-split of the Hamiltonian, resulting in a multi-step unitary evolution operator in discrete time and…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
Gauge symmetries play a fundamental role in Physics, as they provide a mathematical justification for the fundamental forces. Usually, one starts from a non-interactive theory which governs `matter', and features a global symmetry. One then…
To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to…
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…
Causal Graph Dynamics generalize Cellular Automata, extending them to bounded degree, time varying graphs. The dynamics rewrite the graph at each time step with respect to two physics-like symmetries: causality (bounded speed of…
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…
Peter Gacs proposed a one-dimensional cellular automaton capable of a robust self-reproduction. Because the automaton is exceptionally large and complicated, very few people have ever succeeded in simulating it on a computer or analyzing…