Metraipolis › archive › dc_e89fe6fdbac8
A repeating sequence of simple rules creates a universal computer — arXiv:2610.09879
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09879
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:50:03.851Z
- SHA-256 of the archived text
8e01de190bd8f637db7c890103f94ebef9d6fd2aa115640874dc0eff73c85af3- Stable URL of this page
https://metraipolis.com/documento/dc_e89fe6fdbac8
How to cite
A repeating sequence of simple rules creates a universal computer — arXiv:2610.09879 — arXiv (en), https://arxiv.org/abs/2610.09879 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e89fe6fdbac8 (Metraipolis archive dc_e89fe6fdbac8, sha256 8e01de190bd8f637db7c890103f94ebef9d6fd2aa115640874dc0eff73c85af3)
BibTeX
@misc{dce89fe6fdbac8,
title = {A repeating sequence of simple rules creates a universal computer — arXiv:2610.09879},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09879},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e89fe6fdbac8; sha256 8e01de190bd8f637db7c890103f94ebef9d6fd2aa115640874dc0eff73c85af3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09879. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that the Turing complete rule 110 in elementary cellular automata can be emulated by alternating three simple symmetric rules in space. As the constituent rules themselves are trivial, this shows that diversity alone can generate emergent phenomena. The rules cannot distinguish left from right, and the chirality of rule 110 is created by their arrangement. Random initial conditions lock on to rule 110 over 90% of the time, explained through the motion of domain walls between desynchronized regions. Adding random noise creates errors that seed domain walls, whose fraction scales with the square root of noise strength, explained through a simple rate equation. This points to a route to complexity through repeated, perturbed units, common in biology, and shows that in cellular automaton models of quantum field theory, broken symmetries such as parity need not be present in the local rules. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.FL, nuovi lavori del giorno). Categorie arXiv: Cellular Automata and Lattice Gases (nlin.CG) ; Statistical Mechanics (cond-mat.stat-mech); Formal Languages and Automata Theory (cs.FL); Adaptation and Self-Organizing Systems (nlin.AO). Pagina del lavoro: https://arxiv.org/abs/2610.09879 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T12:20:15.269Z dalla pagina https://arxiv.org/list/cs.FL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).