IDEAS home Printed from https://ideas.repec.org/p/nwu/cmsems/923.html
   My bibliography  Save this paper

Philosophical Applications of Kolmogorov's Complexity Measure

Author

Listed:
  • Itzhak Gilboa

Abstract

Kolmogorov has defined the complexity of a sequence of bits to be the minimal size of (the description of) a Turing machine which can regenerate the given sequence. This paper contains two notes on possible applications of this complexity notion to philosophy in general and the philosophy of science in particular. The first presents simplicism--a theory prescribing that people would tend to choose the simplest theory to explain observations, where "simple" is defined by (a version of) Kolmogorov's measure. The second suggests a reinterpretation of a simple observation, saying that reality is almost surely too complex to understand, terms such as "good" and "evil" almost surely too complex to define, and so forth.

Suggested Citation

  • Itzhak Gilboa, 1990. "Philosophical Applications of Kolmogorov's Complexity Measure," Discussion Papers 923, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  • Handle: RePEc:nwu:cmsems:923
    as

    Download full text from publisher

    File URL: http://www.kellogg.northwestern.edu/research/math/papers/923.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2012. "Fact-Free Learning," World Scientific Book Chapters, in: Case-Based Predictions An Axiomatic Approach to Prediction, Classification and Statistical Learning, chapter 8, pages 185-210, World Scientific Publishing Co. Pte. Ltd..
    2. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    3. Itzhak Gilboa & David Schmeidler, 1995. "Case-Based Knowledge and Planning," Discussion Papers 1127, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    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:nwu:cmsems:923. 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: Fran Walker (email available below). General contact details of provider: https://edirc.repec.org/data/cmnwuus.html .

    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.