Philosophical Applications of Kolmogorov's Complexity Measure
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.
|Date of creation:||Oct 1990|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:923. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker)
If references are entirely missing, you can add them using this form.