Universal Simulations by Spatial Machines

Bruno Martin 1
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
Type de document :
Article dans une revue
Journal of Cellular Automata, Old City Publishing, 2007, 2 (3), pp.203-217
Liste complète des métadonnées

Contributeur : Bruno Martin <>
Soumis le : mercredi 16 juillet 2008 - 16:37:36
Dernière modification le : mercredi 31 janvier 2018 - 10:24:05


  • HAL Id : hal-00298560, version 1



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



Consultations de la notice