Rule 110: universality and catenations

Gaétan Richard (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

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].

Domaines: Autre [cs.OH]

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