Reflexive Composition of Elementary State Machines, with an Application to the Reversal of Cellular Automata Rule 90
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915303071416320 |
|---|---|
| author | Salzberg, Chris Sayama, Hiroki |
| author_facet | Salzberg, Chris Sayama, Hiroki |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_07186 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reflexive Composition of Elementary State Machines, with an Application to the Reversal of Cellular Automata Rule 90 Salzberg, Chris Sayama, Hiroki Discrete Mathematics Formal Languages and Automata Theory Cellular Automata and Lattice Gases 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. |
| title | Reflexive Composition of Elementary State Machines, with an Application to the Reversal of Cellular Automata Rule 90 |
| topic | Discrete Mathematics Formal Languages and Automata Theory Cellular Automata and Lattice Gases |
| url | https://arxiv.org/abs/2505.07186 |