Small Turing universal signal machines
J\'er\^ome Durand-Lose

TL;DR
This paper introduces minimal Turing universal signal machines, demonstrating how to construct small, halting universal machines with a limited number of signals and rules from various computational models.
Contribution
It presents the design of the smallest known halting universal signal machine with only 13 meta-signals and 21 collision rules, derived from classical computational models.
Findings
A halting universal signal machine with 13 meta-signals
Construction methods from Turing machines, cellular automata, and cyclic tag systems
Demonstration of minimal signal and rule counts for universality
Abstract
This article aims at providing signal machines as small as possible able to perform any computation (in the classical understanding). After presenting signal machines, it is shown how to get universal ones from Turing machines, cellular-automata and cyclic tag systems. Finally a halting universal signal machine with 13 meta-signals and 21 collision rules is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
