Small Turing universal signal machines
Computational Complexity
2009-06-22 v1 Formal Languages and Automata Theory
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.
Cite
@article{arxiv.0906.3225,
title = {Small Turing universal signal machines},
author = {Jérôme Durand-Lose},
journal= {arXiv preprint arXiv:0906.3225},
year = {2009}
}