The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
LOCAL ACTIVITY IS THE ORIGIN OF COMPLEXITY
Abstract
Many scientists have struggled to uncover the elusive origin of "complexity", and its many equivalent jargons, such as emergence, self-organization, synergetics, collective behaviors, nonequilibrium phenomena, etc. They have provided some qualitative, but not quantitative, characterizations of numerous fascinating examples from many disciplines. For example, Schrödinger had identified "the exchange of energy" from open systems as a necessary condition for complexity. Prigogine has argued for the need to introduce a new principle of nature which he dubbed "the instability of the homogeneous". Turing had proposed "symmetry breaking" as an origin of morphogenesis. Smale had asked what "axiomatic" properties must a reaction–diffusion system possess to make the Turing interacting system oscillate. The purpose of this paper is to show that all the jargons and issues cited above are mere manifestations of a new fundamental principle called local activity, which is mathematically precise and testable. The local activity theorem provides the quantitative characterization of Prigogine's "instability of the homogeneous" and Smale's quest for an axiomatic principle on Turing instability. Among other things, a mathematical proof is given which shows none of the complexity-related jargons cited above is possible without local activity. Explicit mathematical criteria are given to identify a relatively small subset of the locally-active parameter region, called the edge of chaos, where most complex phenomena emerge.
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
Cites
The chemical basis of morphogenesis
Turing, A. M. (1952) · Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences · doi:10.1098/rstb.1952.0012 · Cited by 11,733
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Lectures on Applied Mathematics
(2000) · Springer eBooks · doi:10.1007/978-3-642-59709-1 · Cited by 767
The Fourier integral and its applications
Bolinder, E. F. (1963) · Proceedings of the IEEE · doi:10.1109/proc.1963.1743 · Cited by 607
Cellular Neural Networks and Visual Computing: Foundations and Applications
Chua, L. O., & Roska, T. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511754494 · Cited by 558
Self-citationCNN: A Paradigm for Complexity
Chua, L. O. (1998) · World Scientific Series on Nonlinear Science Series A · doi:10.1142/3801 · Cited by 410
Self-citationEdge of Chaos and Local Activity Domain of FitzHugh-Nagumo Equation
Dogaru, R., & Chua, L. O. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127498000152 · Cited by 96
Self-citationChua, L. O., & Lam, Y.-F. (1973) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1973.1083715 · Cited by 46
Self-citationEdge of Chaos and Local Activity Domain of the Brusselator CNN
Dogaru, R., & Chua, L. O. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127498000899 · Cited by 44
Self-citation
Cited by
A scalable neuristor built with Mott memristors
Pickett, M. D., Medeiros-Ribeiro, G., & Williams, R. S. (2013) · Nature Materials · doi:10.1038/nmat3510 · Cited by 1,033
Chaotic dynamics in nanoscale NbO2 Mott memristors for analogue computing
Kumar, S., Strachan, J. P., & Williams, R. S. (2017) · Nature · doi:10.1038/nature23307 · Cited by 617
Dynamical memristors for higher-complexity neuromorphic computing
Kumar, S., Wang, X., Strachan, J. P., Yang, Y., & Lu, W. D. (2022) · Nature Reviews Materials · doi:10.1038/s41578-022-00434-z · Cited by 558
MUTHUSWAMY, B., & CHUA, L. O. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410027076 · Cited by 514
Self-citationRecent Advances and Future Prospects for Memristive Materials, Devices, and Systems
Song, M.-K., Kang, J.-H., Zhang, X., Ji, W., Ascoli, A., Messaris, I., Demirkol, A. S., Dong, B., Aggarwal, S., Wan, W., et al. (2023) · ACS Nano · doi:10.1021/acsnano.3c03505 · Cited by 300
Self-citation
Metadata
- Authors
- CHUA, L. O.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Ltd
- Published
- 2005-11
- Volume
- 15
- Issue
- 11
- Pages
- 3435-3456
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2018341541
- Cited by
- 325
- References
- 9
- FWCI
- 2.70
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.