Inferring statistical complexity
- 10 July 1989
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 63 (2), 105-108
- https://doi.org/10.1103/physrevlett.63.105
Abstract
Statistical mechanics is used to describe the observed information processing complexity of nonlinear dynamical systems. We introduce a measure of complexity distinct from and dual to the information theoretic entropies and dimensions. A technique is presented that directly reconstructs minimal equations of motion from the recursive structure of measurement sequences. Application to the period-doubling cascade demonstrates a form of superuniversality that refers only to the entropy and complexity of a data stream.Keywords
This publication has 8 references indexed in Scilit:
- Complexity as thermodynamic depthAnnals of Physics, 1988
- Complexity and the Relaxation of Hierarchical StructuresPhysical Review Letters, 1986
- Toward a quantitative theory of self-generated complexityInternational Journal of Theoretical Physics, 1986
- Computation theory of cellular automataCommunications in Mathematical Physics, 1984
- Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noiseInternational Journal of Theoretical Physics, 1982
- Sofic systems and graphsMonatshefte für Mathematik, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- Three models for the description of languageIEEE Transactions on Information Theory, 1956