Self-Replicating Mechanical Universal Turing Machine
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909328413294592 |
|---|---|
| author | Lano, Ralph P. |
| author_facet | Lano, Ralph P. |
| contents | This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the computational power of these mechanisms by explicitly constructing a functioning FSM and TM. This study demonstrates the universality of the system by emulating the UTM(5,5) of Neary and Woods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19037 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Self-Replicating Mechanical Universal Turing Machine Lano, Ralph P. Formal Languages and Automata Theory Computation and Language This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the computational power of these mechanisms by explicitly constructing a functioning FSM and TM. This study demonstrates the universality of the system by emulating the UTM(5,5) of Neary and Woods. |
| title | Self-Replicating Mechanical Universal Turing Machine |
| topic | Formal Languages and Automata Theory Computation and Language |
| url | https://arxiv.org/abs/2409.19037 |