Rule 110: universality and catenations - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Rule 110: universality and catenations


Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has proved than even one of the simplest cellular automata can embed any Turing computation. In this paper, we give a new high-level version of this proof using particles and collisions as introduced in [10].


Other [cs.OH]
Fichier principal
Vignette du fichier
141-160.pdf (2.1 Mo) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00273995 , version 1 (16-04-2008)


  • HAL Id : hal-00273995 , version 1


Gaétan Richard. Rule 110: universality and catenations. JAC 2008, Apr 2008, Uzès, France. pp.141-160. ⟨hal-00273995⟩
162 View
141 Download


Gmail Facebook Twitter LinkedIn More