The DOI matches its Crossref record.
CLARIFYING CHAOS: EXAMPLES AND COUNTEREXAMPLES
Abstract
Over the past fifteen years there have been various attempts to define chaos. In an effort to find a universally acceptable definition we began constructing new examples of chaotic systems in the hope that the salient features of chaos could be captured. Our efforts to date have failed and the examples we have constructed seem to suggest that no such definition exists. However, these examples have proved to be valuable in spite of our inability to hone a universal definition of chaos from them. Consequently, we present this list of examples and their significance. Some interesting conclusions that we can draw from them are: It is possible to construct simple closed form solutions of chaotic one-dimensional maps; sensitive dependence on initial conditions, the most widely used definition of chaos, has many counterexamples; there are invertible chaotic dynamical systems defined by simple differential equations that do not have horseshoes; three important properties that are thought to characterize chaos, continuous power spectral density, exponentially sensitive dependence on initial conditions, and exponential loss of information (Chaitin’s concept of algorithmic complexity), are independent. Chaos seems to be tied to our notion of rates of divergence of orbits or degradation of information such as is found in systems with positive Lyapunov exponents. The reliance on rates seems to open the door to a pandora’s box of rates, both higher and lower than exponential. The intuitive notion of pseudo-randomness, a practical feature of chaos, is present in examples that do not have positive Lyapunov exponents. And in general, nonlinear polynomial rates of degradation of information are also quite “unpredictable”. We conclude that it appears that for any given definition of chaos, there may always be some “clearly” chaotic systems which do not fall under that definition, thus making chaos a cousin to Gödel’s undecidability.
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
Cited by
Symmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917
ON THE DYNAMICAL DEGRADATION OF DIGITAL PIECEWISE LINEAR CHAOTIC MAPS
LI, S., CHEN, G., & MOU, X. (2005) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127405014052 · Cited by 433
A novel algorithm for image encryption based on mixture of chaotic maps
Behnia, S., Akhshani, A., Mahmodi, H., & Akhavan, A. (2008) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.05.011 · Cited by 430
Control of chaos: Methods and applications in engineering
Fradkov, A. L., & Evans, R. J. (2005) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2005.01.001 · Cited by 403
Kulsoom, A., Xiao, D., Aqeel-ur-Rehman, & Abbas, S. A. (2016) · Multimedia Tools and Applications · doi:10.1007/s11042-014-2221-x · Cited by 331
Metadata
- Authors
- BROWN, R., & CHUA, L. O.
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 1996-02
- Volume
- 06
- Issue
- 02
- Pages
- 219-249
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2015710702
- Cited by
- 169
- References
- 0
- FWCI
- 5.13
- 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: CLARIFYING CHAOS: EXAMPLES AND COUNTEREXAMPLES. https://app.cochat.ai/papers/10.1142/s0218127496000023
- The paper
- BROWN, R., & CHUA, L. O. (1996). CLARIFYING CHAOS: EXAMPLES AND COUNTEREXAMPLES. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127496000023
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.