The DOI matches its Crossref record.
Universality in Elementary Cellular Automata
Open accessAbstract
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].
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Mitchell, M. (2009) · doi:10.1093/oso/9780195124415.001.0001 · Cited by 2,310
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Diverse and robust molecular algorithms using reprogrammable DNA self-assembly
Woods, D., Doty, D., Myhrvold, C., Hui, J., Zhou, F., Yin, P., & Winfree, E. (2019) · Nature · doi:10.1038/s41586-019-1014-9 · Cited by 295
Gershenson, C., & Fernández, N. (2012) · Complexity · doi:10.1002/cplx.21424 · Cited by 179
“Rules from class IV generate critical dynamics, and some have been proven to be capable of universal computation (Cook, 2004).”
BackgroundA review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138
Metadata
- Authors
- Department of Computation and Neural Systems, C., & Cook, M.
- Venue
- Complex Systems
- Publisher
- Wolfram Research, Inc.
- Published
- 2004-03-15
- Volume
- 15
- Issue
- 1
- Pages
- 1-40
- ISSN
- 0891-2513 (ISSN-L)
- OpenAlex
- W2620826411
- Cited by
- 681
- References
- 0
- FWCI
- 13.61
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Universality in Elementary Cellular Automata. https://app.cochat.ai/papers/10.25088/complexsystems.15.1.1
- The paper
- Department of Computation and Neural Systems, C., & Cook, M. (2004). Universality in Elementary Cellular Automata. Complex Systems. https://doi.org/10.25088/complexsystems.15.1.1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.