Self-replication and Computational Universality
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_ | 1866918157574209536 |
|---|---|
| author | Cotler, Jordan Hongler, Clément Hudcová, Barbora |
| author_facet | Cotler, Jordan Hongler, Clément Hudcová, Barbora |
| contents | Self-replication is central to all life, and yet how it dynamically emerges in physical, non-equilibrium systems remains poorly understood. Von Neumann's pioneering work in the 1940s and subsequent developments suggest a natural hypothesis: that any physical system capable of Turing-universal computation can support self-replicating objects. In this work, we challenge this hypothesis by clarifying what computational universality means for physical systems and constructing a cellular automaton that is Turing-universal but cannot sustain non-trivial self-replication. By analogy with biology, such dynamics manifest transcription and translation but cannot instantiate replication. More broadly, our work emphasizes that the computational complexity of translating between physical dynamics and symbolic computation is inseparable from any claim of universality (exemplified by our analysis of Rule 110) and builds mathematical foundations for identifying self-replicating behavior. Our approach enables the formulation of necessary dynamical and computational conditions for a physical system to constitute a living organism. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08342 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Self-replication and Computational Universality Cotler, Jordan Hongler, Clément Hudcová, Barbora Cellular Automata and Lattice Gases Formal Languages and Automata Theory Adaptation and Self-Organizing Systems Self-replication is central to all life, and yet how it dynamically emerges in physical, non-equilibrium systems remains poorly understood. Von Neumann's pioneering work in the 1940s and subsequent developments suggest a natural hypothesis: that any physical system capable of Turing-universal computation can support self-replicating objects. In this work, we challenge this hypothesis by clarifying what computational universality means for physical systems and constructing a cellular automaton that is Turing-universal but cannot sustain non-trivial self-replication. By analogy with biology, such dynamics manifest transcription and translation but cannot instantiate replication. More broadly, our work emphasizes that the computational complexity of translating between physical dynamics and symbolic computation is inseparable from any claim of universality (exemplified by our analysis of Rule 110) and builds mathematical foundations for identifying self-replicating behavior. Our approach enables the formulation of necessary dynamical and computational conditions for a physical system to constitute a living organism. |
| title | Self-replication and Computational Universality |
| topic | Cellular Automata and Lattice Gases Formal Languages and Automata Theory Adaptation and Self-Organizing Systems |
| url | https://arxiv.org/abs/2510.08342 |