Please use this identifier to cite or link to this item:
Gilboa, Itzhak
Year of Publication: 
Series/Report no.: 
Discussion Paper No. 923
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.
Document Type: 
Working Paper

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.