Two-state, Reversible, Universal Cellular Automata in Three Dimensions
Daniel B. Miller, Edward Fredkin
Abstract
A novel two-state, Reversible Cellular Automata (RCA) is described. This three-dimensional RCA is shown to be capable of universal computation. Additionally, evidence is offered that this RCA Is capable of universal construction.
Create a lesson
Related papers
Computing functions through the orbits of dynamical systems: the case of cellular automata
Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara
Geometry-Controlled Initial-Density Dependence in Branching-Merging Exclusion Processes
Hiroki Yamamoto, Daichi Yanagisawa, Katsuhiro Nishinari
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule
Rolf Hoffmann
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian