The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Computation at the edge of chaos: Phase transitions and emergent computation
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“As it has been proposed, adaptive systems require a high C in order to be able to cope with changes of its environment while at the same time maintaining their integrity (Langton, 1990; Kauffman, 1993).”
From Information Measures of Complexity, Emergence, Self-organization, Homeostasis, and Autopoiesis (2013) · cites this paper as Langton, 1990
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“As it has been proposed by several authors, complexity can be seen as balance between order and disorder (Langton, 1990; Kauffman, 1993; Lopez-Ruiz et al., 1995)”
From Information Measures of Complexity, Emergence, Self-organization, Homeostasis, and Autopoiesis (2013) · cites this paper as Langton, 1990
The cited source says what the claim attributes to it.
In the citing paper
“It has been argued that computation and life require this balance to be able to compute and adapt (Langton, 1990; Kauffman, 1993).”
From Information Measures of Complexity, Emergence, Self-organization, Homeostasis, and Autopoiesis (2013) · cites this paper as Langton, 1990
In the citing paper
“Finally, we show that a randomly connected circuit model, akin to a “reservoir” network13-15, can reproduce the observed distribution of timescales, provided that the network operates at the critical point (or “edge of chaos”)16-18.”
From A reservoir of time constants for memory traces in cortical neurons (2011) · cites this paper as [18]
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
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,468
Metabolic stability and epigenesis in randomly constructed genetic nets
Kauffman, S. A. (1969) · Journal of Theoretical Biology · doi:10.1016/0022-5193(69)90015-0 · Cited by 4,871
Bak, P., Tang, C., & Wiesenfeld, K. A. (1988) · Physical Review A · doi:10.1103/physreva.38.364 · Cited by 4,744
Statistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,199
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,956
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Gardner, M. R. (1970) · Scientific American · doi:10.1038/scientificamerican1070-120 · Cited by 1,764
Complexity, Entropy And The Physics Of Information
Zurek, W. H. (2018) · CRC Press eBooks · doi:10.1201/9780429502880 · Cited by 1,451
Winning Ways for Your Mathematical Plays.
Connelly, R., Berlekamp, E. R., Conway, J. H., & Guy, R. K. (1986) · American Mathematical Monthly · doi:10.2307/2323620 · Cited by 1,432
Codd, E. F. (1968) · Cited by 1,366
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 935
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
Studying artificial life with cellular automata
Langton, C. G. (1986) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(86)90237-x · Cited by 698
Self-citationBurks, A. W. (1970) · Medical Entomology and Zoology · Cited by 656
Information theory and the living system
Gatlin, L. L. (1972) · Medical Entomology and Zoology · Cited by 494
Two-dimensional cellular automata
Packard, N. H., & Wolfram, S. (1985) · Journal of Statistical Physics · doi:10.1007/bf01010423 · Cited by 470
Two-Dimensional Cellular Automata
Wolfram, S. (2018) · CRC Press eBooks · doi:10.1201/9780429494093-6 · Cited by 311
Emergent properties in random complex automata
Kauffman, S. A. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90257-4 · Cited by 256
Adaptation toward the Edge of Chaos
Packard, N. H. (1988) · Medical Entomology and Zoology · Cited by 241
Simple Computation-Universal Cellular Spaces
Smith, A. R. (1971) · Journal of the ACM · doi:10.1145/321650.321652 · Cited by 175
Local structure theory for cellular automata
Gutowitz, H. A., Victor, J. D., & Knight, B. W. (1987) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(87)90120-5 · Cited by 169
The Structure of the Elementary Cellular Automata Rule Space
Li, W., & Packard, N. H. (1990) · Cited by 166
A hierarchical classification of cellular automata
Gutowitz, H. A. (1990) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(90)90179-s · Cited by 68
Is there a sharp phase transition for deterministic cellular automata?
Wootters, W. K., & Langton, C. G. (1990) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(90)90176-p · Cited by 40
Self-citationAnnealed and quenched inhomogeneous cellular automata (INCA)
Vichniac, G. Y., Tamayo, P., & Hartman, H. (1986) · Journal of Statistical Physics · doi:10.1007/bf01020578 · Cited by 38
Research works printed but not linked: 1
- Kolmogorov, 1965, Prob. Inf. Transm., 1, 1
Cited by
Sorted by citations
White, R. W., & Engelen, G. (1993) · Environment and Planning A Economy and Space · doi:10.1068/a251175 · Cited by 1,113
Real-Time Computation at the Edge of Chaos in Recurrent Neural Networks
Bertschinger, N., & Natschläger, T. (2004) · Neural Computation · doi:10.1162/089976604323057443 · Cited by 833
Optimal dynamical range of excitable networks at criticality
Kinouchi, O., & Copelli, M. (2006) · Nature Physics · doi:10.1038/nphys289 · Cited by 831
The Coevolution of New Organizational Forms
Lewin, A. Y., Long, C. P., & Carroll, T. N. (1999) · Organization Science · doi:10.1287/orsc.10.5.535 · Cited by 806
Supply network disruption and resilience: A network structural perspective
Kim, Y., Chen, Y., & Linderman, K. (2014) · Journal of Operations Management · doi:10.1016/j.jom.2014.10.006 · Cited by 817
Metadata
- Authors
- Langton, C. G.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Langton, Chris G.
- Venue
- Physica D: Nonlinear Phenomena
- Publisher
- Elsevier BV
- Published
- 1990-06
- Volume
- 42
- Issue
- 1-3
- Pages
- 12-37
- ISSN
- 0167-2789 (ISSN-L)
- OpenAlex
- W2177218873
- Cited by
- 1,527
- References
- 26
- Citations by year
- 2026: 66 · 2025: 61 · 2024: 93 · 2023: 51 · 2022: 67 · 2021: 63 · 2020: 71 · 2019: 48 · 2018: 73 · 2017: 70 · 2016: 42 · 2015: 56 · 2014: 51 · 2013: 72 · 2012: 59
- FWCI
- 14.66
- Type
- journal article
- Language
- en
- Open access
- green
- www.osti.gov
- Locations
- Physica D Nonlinear Phenomena (publishedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Keywords
- emergent computation, phase transitions, cellular automata, tipping points, second-order phase transition, information transmission, information storage, complexity classes, halting problem, edge of chaos
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
