IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0096223.html
   My bibliography  Save this article

Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Author

Listed:
  • Fernando Soler-Toscano
  • Hector Zenil
  • Jean-Paul Delahaye
  • Nicolas Gauvrit

Abstract

Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all binary strings of length and for most strings of length by running all Turing machines with 5 states and 2 symbols ( with reduction techniques) using the most standard formalism of Turing machines, used in for example the Busy Beaver problem. We address the question of stability and error estimation, the sensitivity of the continued application of the method for wider coverage and better accuracy, and provide statistical evidence suggesting robustness. As with compression algorithms, this work promises to deliver a range of applications, and to provide insight into the question of complexity calculation of finite (and short) strings.Additional material can be found at the Algorithmic Nature Group website at http://www.algorithmicnature.org. An Online Algorithmic Complexity Calculator implementing this technique and making the data available to the research community is accessible at http://www.complexitycalculator.com.

Suggested Citation

  • Fernando Soler-Toscano & Hector Zenil & Jean-Paul Delahaye & Nicolas Gauvrit, 2014. "Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines," PLOS ONE, Public Library of Science, vol. 9(5), pages 1-18, May.
  • Handle: RePEc:plo:pone00:0096223
    DOI: 10.1371/journal.pone.0096223
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0096223
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0096223&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0096223?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
    ---><---

    References listed on IDEAS

    as
    1. Jean-Paul Delahaye & Hector Zenil, 2012. "Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness," Post-Print hal-00825530, HAL.
    2. Brandouy, Olivier & Delahaye, Jean-Paul & Ma, Lin & Zenil, Hector, 2014. "Algorithmic complexity of financial motions," Research in International Business and Finance, Elsevier, vol. 30(C), pages 336-347.
    3. Jean-Paul Delahaye & Hector Zenil, 2007. "On the Kolmogorov Complexity for Short Sequences," Post-Print hal-00731944, HAL.
    4. Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Dingle, Kamaludin & Kamal, Rafiq & Hamzi, Boumediene, 2023. "A note on a priori forecasting and simplicity bias in time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    2. Ferman Hasan, 2021. "Contribution of eye-tracking to the study on perception of the complexity," Technium Social Sciences Journal, Technium Science, vol. 20(1), pages 612-626, June.
    3. Mikołaj Morzy & Tomasz Kajdanowicz & Przemysław Kazienko, 2017. "On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy," Complexity, Hindawi, vol. 2017, pages 1-12, November.
    4. Huaylla, Claudia A. & Kuperman, Marcelo N. & Garibaldi, Lucas A., 2024. "Comparison of two statistical measures of complexity applied to ecological bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 642(C).
    5. Maxwell Murialdo & Arturo Cifuentes, 2022. "Quantifying Value with Effective Complexity," Journal of Interdisciplinary Economics, , vol. 34(1), pages 69-85, January.
    6. Fernando Soler-Toscano & Hector Zenil, 2017. "A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences," Complexity, Hindawi, vol. 2017, pages 1-10, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fernando Soler-Toscano & Hector Zenil, 2017. "A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences," Complexity, Hindawi, vol. 2017, pages 1-10, December.
    2. Brandouy, Olivier & Delahaye, Jean-Paul & Ma, Lin & Zenil, Hector, 2014. "Algorithmic complexity of financial motions," Research in International Business and Finance, Elsevier, vol. 30(C), pages 336-347.
    3. Daniel Wilson-Nunn & Hector Zenil, 2014. "On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets," Papers 1411.1924, arXiv.org.
    4. Dingle, Kamaludin & Kamal, Rafiq & Hamzi, Boumediene, 2023. "A note on a priori forecasting and simplicity bias in time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    5. Serbera, Jean-Philippe & Paumard, Pascal, 2016. "The fall of high-frequency trading: A survey of competition and profits," Research in International Business and Finance, Elsevier, vol. 36(C), pages 271-287.
    6. Zenil, Hector & Soler-Toscano, Fernando & Dingle, Kamaludin & Louis, Ard A., 2014. "Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 404(C), pages 341-358.
    7. Maxwell Murialdo & Arturo Cifuentes, 2022. "Quantifying Value with Effective Complexity," Journal of Interdisciplinary Economics, , vol. 34(1), pages 69-85, January.
    8. Mikołaj Morzy & Tomasz Kajdanowicz & Przemysław Kazienko, 2017. "On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy," Complexity, Hindawi, vol. 2017, pages 1-12, November.

    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:plo:pone00:0096223. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.