IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v140y1986i1p319-325.html
   My bibliography  Save this article

How to measure self-generated complexity

Author

Listed:
  • Grassberger, Peter

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.

Suggested Citation

  • Grassberger, Peter, 1986. "How to measure self-generated complexity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 140(1), pages 319-325.
    • Handle: RePEc:eee:phsmap:v:140:y:1986:i:1:p:319-325
    DOI: 10.1016/0378-4371(86)90238-4
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378437186902384
    Download Restriction: 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
    File URL: https://libkey.io/10.1016/0378-4371(86)90238-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Aleksandar Aksentijevic, 2017. "Randomness: off with its heads (and tails)," Mind & Society: Cognitive Studies in Economics and Social Sciences, Springer;Fondazione Rosselli, vol. 16(1), pages 1-15, November.
    2. Aksentijevic, A. & Mihailović, D.T. & Kapor, D. & Crvenković, S. & Nikolic-Djorić, E. & Mihailović, A., 2020. "Complementarity of information obtained by Kolmogorov and Aksentijevic–Gibson complexities in the analysis of binary time series," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:140:y:1986:i:1:p:319-325. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.