Abstract geometrical computation 4: small Turing universal signal machines
Résumé
This article provides several very small signal machines able to perform any computation ---in the classical understanding--- generated from Turing machines, cellular automata and cyclic tag systems. A halting universal signal machine with 13 meta-signals and 21 collision rules is presented (resp. 15 and 24 for a robust version). If infinitely many signals are allowed to be present in the initial configuration, 5 meta-signals and 7 collision rules are enough to achieve non-halting weak universality (resp. 6 and 9 for a robust version).
Origine : Fichiers produits par l'(les) auteur(s)
Loading...