Reflexive Composition of Elementary State Machines, with an Application to the Reversal of Cellular Automata Rule 90
By: Chris Salzberg, Hiroki Sayama
Potential Business Impact:
Creates new ways to reverse computer processes.
We explore the dynamics of a one-dimensional lattice of state machines on two states and two symbols sequentially updated via a process of "reflexive composition." The space of 256 machines exhibits a variety of behavior, including substitution, reversible "billiard ball" dynamics, and fractal nesting. We show that one machine generates the Sierpinski Triangle and, for a subset of boundary conditions, is isomorphic to cellular automata Rule 90 in Wolfram's naming scheme. More surprisingly, two other machines follow trajectories that map to Rule 90 in reverse. Whereas previous techniques have been developed to uncover preimages of Rule 90, this is the first study to produce such inverse dynamics naturally from the formalism itself. We argue that the system's symmetric treatment of state and message underlies its expressive power.
Similar Papers
Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity and Reversibility
Discrete Mathematics
Makes computer rules predictable and reversible.
An Expressive Coalgebraic Modal Logic for Cellular Automata
Logic in Computer Science
Makes computers understand how things change.
Combinatorial Designs and Cellular Automata: A Survey
Combinatorics
Makes secret codes harder to break.