 |
|
|
|
| HAL: hal-00504876, version 1 |
| DOI: 10.1016/j.tcs.2010.07.013 |
| Detailed view |  Export this paper |
|
|
| Theoretical Computer Science 412 (2011) 57-67 |
|
|
|
|
| Abstract geometrical computation 4: small Turing universal signal machines |
|
|
| Jérôme Durand-Lose 1 |
|
|
| (2011) |
|
|
|
| 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). |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| LIFO-GA |
|
|
|
|
| Subject | : | Computer Science/Formal Languages and Automata Theory |
|
|
| Abstract geometrical computation – cyclic tag systems – Turing universality – signal machines – small universal machines |
|
| hal-00504876, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00504876 | |
| oai:hal.archives-ouvertes.fr:hal-00504876 | |
| From: Jérôme Durand-Lose | |
| Submitted on: Wednesday, 21 July 2010 16:38:25 | |
| Updated on: Wednesday, 1 December 2010 10:42:49 | |
