Abstract geometrical computation 4: small Turing universal signal machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2011

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).
Fichier principal
Vignette du fichier
2011_TCS_WCSP.pdf (242.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00504876 , version 1 (08-11-2012)

Identifiants

Citer

Jérôme Durand-Lose. Abstract geometrical computation 4: small Turing universal signal machines. Theoretical Computer Science, 2011, 412, pp.57-67. ⟨10.1016/j.tcs.2010.07.013⟩. ⟨hal-00504876⟩
96 Consultations
307 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More