The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
CNN: A Vision of Complexity
Abstract
CNN is an acronym for either Cellular Neural Network when used in the context of brain science, or Cellular Nonlinear Network when used in the context of coupled dynamical systems. A CNN is defined by two mathematical constructs: 1. A spatially discrete collection of continuous nonlinear dynamical systems called cells, where information can be encrypted into each cell via three independent variables called input, threshold, and initial state. 2. A coupling law relating one or more relevant variables of each cell C ij to all neighbor cells C kl located within a prescribed sphere of influence S ij(r) of radius r, centered at C ij. In the special case where the CNN consists of a homogeneous array, and where its cells have no inputs, no thresholds, and no outputs, and where the sphere of influence extends only to the nearest neighbors (i.e. r = 1), the CNN reduces to the familiar concept of a nonlinear lattice. The bulk of this three-part exposition is devoted to the standard CNN equation [Formula: see text] where x ij, y ij, u ij and z ij are scalars called state, output, input, and threshold of cell C ij; a kl and b kl are scalars called synaptic weights, and S ij(r) is the sphere of influence of radius r. In the special case where r = 1, a standard CNN is uniquely defined by a string of "19" real numbers (a uniform thresholdz kl = z, nine feedback synaptic weights a kl, and nine control synaptic weights b kl) called a CNN gene because it completely determines the properties of the CNN. The universe of all CNN genes is called the CNN genome. Many applications from image processing, pattern recognition, and brain science can be easily implemented by a CNN "program" defined by a string of CNN genes called a CNN chromosome. The first new result presented in this exposition asserts that every Boolean function of the neighboring-cell inputs can be explicitly synthesized by a CNN chromosome. This general theorem implies that every cellular automata (with binary states) is a CNN chromosome. In particular, a constructive proof is given which shows that the game-of-life cellular automata can be realized by a CNN chromosome made of only three CNN genes. Consequently, this "game-of-life" CNN chromosome is a universal Turing machine, and is capable of self-replication in the Von Neumann sense [Berlekamp et al., 1982]. One of the new concepts presented in this exposition is that of a generalized cellular automata (GCA), which is outside the framework of classic cellular (Von Neumann) automata because it cannot be defined by local rules: It is simply defined by iterating a CNN gene, or chromosome, in a "CNN DO LOOP". This new class of generalized cellular automata includes not only global Boolean maps, but also continuum-state cellular automata where the initial state configuration and its iterates are real numbers, not just a finite number of states as in classical (von Neumann) cellular automata. Another new result reported in this exposition is the successful implementation of an analog input analog output CNN universal machine, called a CNN universal chip, on a single silicon chip. This chip is a complete dynamic array stored-program computer where a CNN chromosome (i.e. a CNN algorithm or flow chart) can be programmed and executed on the chip at an extremely high speed of 1 Tera (10 12) analog instructions per second (based on a 100 × 100 chip). The CNN universal chip is based entirely on nonlinear dynamics and therefore differs from a digital computer in its fundamental operating principles. Part II of this exposition is devoted to the important subclass of autonomous CNNs where the cells have no inputs. This class of CNNs can exhibit a great variety of complex phenomena, including pattern formation, Turing patterns, knots, auto waves, spiral waves, scroll waves, and spatiotemporal chaos. It provides a unified paradigm for complexity, as well as an alternative paradigm for simulating nonlinear partial differential equations (PDE's). In this context, rather than regarding the autonomous CNN as an approximation of nonlinear PDE's, we advocate the more provocative point of view that nonlinear PDE's are merely idealizations of CNNs, because while nonlinear PDE's can be regarded as a limiting form of autonomous CNNs, only a small class of CNNs has a limiting PDE representation. Part III of this exposition is rather short but no less significant. It contains in fact the potentially most important original results of this exposition. In particular, it asserts that all of the phenomena described in the complexity literature under various names and headings (e.g. synergetics, dissipative structures, self-organization, cooperative and competitive phenomena, far-from-thermodynamic equilibrium phenomena, edge of chaos, etc.) are merely qualitative manifestations of a more fundamental and quantitative principle called the local activity dogma. It is quantitative in the sense that it not only has a precise definition but can also be explicitly tested by computing whether a certain explicitly defined expression derived from the CNN paradigm can assume a negative value or not. Stated in words, the local activity dogma asserts that in order for a system or model to exhibit any form of complexity, such as those cited above, the associated CNN parameters must be chosen so that either the cells or their couplings are locally active.
Overview
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.
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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
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
Cellular neural networks: theory
Chua, L. O., & Yang, L. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.7600 · Cited by 4,769
Self-citationUniversality and complexity in cellular automata
Wolfram, S. (1984) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,914
Computation at the edge of chaos: Phase transitions and emergent computation
Langton, C. G. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90064-v · Cited by 1,527
Chua, L. O., & Roska, T. (1993) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.222795 · Cited by 1,190
Self-citationAllessie, M. A., Bonke, F. I., & Schopman, F. J. (1977) · Circulation Research · doi:10.1161/01.res.41.1.9 · Cited by 1,066
Cooperative phenomena in systems far from thermal equilibrium and in nonphysical systems
Haken, H. (1975) · Reviews of Modern Physics · doi:10.1103/revmodphys.47.67 · Cited by 999
Fading memory and the problem of approximating nonlinear operators with Volterra series
Boyd, S., & Chua, L. (1985) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1985.1085649 · Cited by 991
Self-citationThe CNN universal machine: an analogic array computer
Roska, T., & Chua, L. O. (1993) · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · doi:10.1109/82.222815 · Cited by 982
Self-citation
Cited by
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
XAI-based Clinical Decision Support System: A Systematic Review
Kim, S., Kim, D., Kim, M., Ko, H., & Jeong, O. (2024) · doi:10.20944/preprints202406.0721.v1 · Cited by 72
Metadata
- Authors
- Chua, L. O.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 1997-10
- Volume
- 07
- Issue
- 10
- Pages
- 2219-2425
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W1974011730
- Cited by
- 336
- References
- 35
- FWCI
- 11.65
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: CNN: A Vision of Complexity. https://app.cochat.ai/papers/10.1142/s0218127497001618
- The paper
- Chua, L. O. (1997). CNN: A Vision of Complexity. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127497001618
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.