 |
|
|
|
| HAL: hal-00273995, version 1 |
| Detailed view |  Export this paper |
|
|
| JAC 2008, Uzès : France (2008) |
|
|
|
|
| Rule 110: universality and catenations |
|
|
Gaétan Richard 1 |
|
|
| (2008-04-10) |
|
|
|
| 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]. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00273995, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00273995 | |
| oai:hal.archives-ouvertes.fr:hal-00273995 | |
| From: Bruno Durand | |
| Submitted on: Wednesday, 16 April 2008 23:06:16 | |
| Updated on: Friday, 18 April 2008 21:00:51 | |
