Universal Simulations by Spatial Machines - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Cellular Automata Année : 2007

Universal Simulations by Spatial Machines

Résumé

In this paper, we consider the relation between spatial machines, Turing machines and cellular automata. We first recall and correct a mistake in the original simulation of a Turing machine by a spatial machine. We also propose a parallel simulation of cellular automata by a uniform family of spatial machines. Then, we deduce from the previous simulations the universality of spatial machines, the undecidability of the occurrence of a state and the P-completeness of the General Machine Simulation Problem for spatial machines
Fichier non déposé

Dates et versions

hal-00298560 , version 1 (16-07-2008)

Identifiants

  • HAL Id : hal-00298560 , version 1

Citer

Bruno Martin. Universal Simulations by Spatial Machines. Journal of Cellular Automata, 2007, 2 (3), pp.203-217. ⟨hal-00298560⟩
70 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More