How to measure self-generated complexity

Peter Grassberger

Physica A: Statistical Mechanics and its Applications, 1986, vol. 140, issue 1, 319-325

Abstract: In an increasing number of simple dynamical systems, patterns arise which are judged as “complex” in some naive sense. In this talk, quantities are discussed which can serve as measures of this complexity. They are measure-theoretic constructs. In contrast to the Kolmogorov complexity, they are small both for completely ordered and for completely random patterns. Some of the most interesting patterns have indeed zero randomness but infinite complexity in the present sense.

Date: 1986
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378437186902384
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:140:y:1986:i:1:p:319-325

DOI: 10.1016/0378-4371(86)90238-4

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().