A Particular Universal Cellular Automaton
نویسندگان
چکیده
Signals are a classical tool used in cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collisions formalize this idea one step further, describing regular nets of colliding signals. In the present paper, we investigate the use of particles and collisions for constructions involving an infinite number of interacting particles. We obtain a high-level construction for a new smallest intrinsically universal cellular automaton with 4 states.
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملComputation and Construction Universality of Reversible Cellular Automata
An arbitrary d-dimensional cellular automaton can be constructively embedded in a reversible one having d + 1 dimensions. In particular, there exist computationand construction-universal reversible cellular automata. Thus, we explicitly show a way of implementing nontrivial irreversible processes in a reversible medium. Finally, we derive new results for the bounding problem for configurations,...
متن کاملA weakly universal universal cellular automaton in the heptagrid
A weakly universal cellular automaton in the heptagrid. Abstract In this paper, we construct a weakly universal cellular automaton in the heptagrid, the tessellation {7, 3} which is not rotation invariant but which is truly planar. This result, under these conditions, cannot be improved for the tessellations {p, 3}.
متن کاملA Quantum Game of Life
This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular form, where incoming information is scattered by a fixed unitary U before being redistributed and rescattered. Our construction is minimal amongst PQCA, hav...
متن کاملA Weakly Universal Cellular Automaton with 2 States on the Tiling {11, 3}
In this paper, we construct a weakly universal cellular automaton with two states only on the tiling {11, 3}. The cellular automaton is rotation invariant and it is a true planar one.
متن کامل