Cited by 571Cellular Automata and Applicationssemigroups and automata theoryComputability, Logic, AI Algorithms

Self-reproduction in cellular automata

Open access
Langton, Christopher G.·1984·Physica D: Nonlinear Phenomena

Integrity signals

Registry

Crossref · 10.1016/0167-2789(84)90256-2

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The search for other formal systems able to self-replicate, usually defined on a two-dimensional lattice, has shown simpler examples with a much smaller number of parts than those proposed initially by von Neumann.

    “The search for other formal systems able to self-replicate, usually defined on a two-dimensional lattice, has shown simpler examples with a much smaller number of parts than those proposed initially by von Neumann [64,153].”

    From Fundamental constraints to the logic of living systems (2024) · cites this paper as [64]

Cited by

Sorted by citations

Authors
Langton, C. G.
Affiliations
University of Michigan (US)
Corresponding author
Langton, Christopher G.
Venue
Physica D: Nonlinear Phenomena
Publisher
Elsevier BV
Published
1984-01
Volume
10
Issue
1-2
Pages
135-144
ISSN
0167-2789 (ISSN-L)
OpenAlex
W2164199443
Cited by
571
References
0
Citations by year
2026: 8 · 2025: 13 · 2024: 14 · 2023: 26 · 2022: 7 · 2021: 15 · 2020: 13 · 2019: 10 · 2018: 13 · 2017: 16 · 2016: 19 · 2015: 19 · 2014: 22 · 2013: 17 · 2012: 20
FWCI
1.50
Type
journal article
Language
en
Open access
Locations
  • Physica D Nonlinear Phenomena (publishedVersion)
  • Deep Blue (University of Michigan) (submittedVersion)
Funders
National Science Foundation (7826016)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
Keywords
self-replication, cellular automata, universal constructions, self-replicating machines

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