Universality in Elementary Cellular Automata
Complex Systems · 15.03.2004 · 15 (1) · 1-40
DOI: 10.25088/complexsystems.15.1.1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Complex Systems, online erschienen am 15.03.2004. Verfasst von Matthew Cook. Die Arbeit wurde bisher 395-mal zitiert (Crossref).
Abstract (Originalsprache)
The purpose of this paper is to prove a conjecture made by Stephen Wolfram in 1985, that an elementary one dimensional cellular automaton known as "Rule 110" is capable of universal computation. I developed this proof of his conjecture while assisting Stephen Wolfram on research for A New Kind of Science [1].
Zitieren
APA
Cook, M. (2004). Universality in Elementary Cellular Automata. Complex Systems, 15(1), 1-40. https://doi.org/10.25088/complexsystems.15.1.1
Vancouver
Cook M. Universality in Elementary Cellular Automata. Complex Systems. 2004;15(1):1-40. doi:10.25088/complexsystems.15.1.1
BibTeX
@article{Cook2004,
author = {Cook, Matthew},
title = {Universality in Elementary Cellular Automata},
journal = {Complex Systems},
year = {2004},
volume = {15},
number = {1},
pages = {1--40},
doi = {10.25088/complexsystems.15.1.1}
}
EUVIMED