Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 681

The DOI matches its Crossref record.

Universality in Elementary Cellular Automata

Open access
Department of Computation and Neural Systems, Caltech, Mail Stop 136-93, Pasadena, California 91125, USA, Cook, Matthew · 2004 · Complex Systems

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.25088/complexsystems.15.1.1

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 681

Metadata

Authors
Department of Computation and Neural Systems, C., & Cook, M.
Venue
Complex Systems
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.