Universal Simulations by Spatial Machines

Bruno Martin 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : 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
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00298560
Contributor : Bruno Martin <>
Submitted on : Wednesday, July 16, 2008 - 4:37:36 PM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM

Identifiers

  • HAL Id : hal-00298560, version 1

Collections

Citation

Bruno Martin. Universal Simulations by Spatial Machines. Journal of Cellular Automata, Old City Publishing, 2007, 2 (3), pp.203-217. ⟨hal-00298560⟩

Share

Metrics

Record views

124