Rule 110: universality and catenations

Abstract : 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].
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00273995
Contributor : <>
Submitted on : Wednesday, April 16, 2008 - 11:06:16 PM
Last modification on : Thursday, April 25, 2019 - 11:26:04 AM
Long-term archiving on : Friday, September 28, 2012 - 12:45:31 PM

File

141-160.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-00273995, version 1

Collections

Citation

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

Share

Metrics

Record views

270

Files downloads

130