Self-Replicating Mechanical Universal Turing Machine
Formal Languages and Automata Theory
2024-10-01 v1 Computation and Language
Abstract
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.
Cite
@article{arxiv.2409.19037,
title = {Self-Replicating Mechanical Universal Turing Machine},
author = {Ralph P. Lano},
journal= {arXiv preprint arXiv:2409.19037},
year = {2024}
}