Epistemology as Information Theory : From Leibniz to Ω ∗
暂无分享,去创建一个
In 1686 in his Discours de métaphysique, Leibniz points out that if an arbitrarily complex theory is permitted then the notion of “theory” becomes vacuous because there is always a theory. This idea is developed in the modern theory of algorithmic information, which deals with the size of computer programs and provides a new view of Gödel’s work on incompleteness and Turing’s work on uncomputability. Of particular interest is the halting probability Ω, whose bits are irreducible, i.e., maximally unknowable mathematical facts. More generally, these ideas constitute a kind of “digital philosophy” related to recent attempts of Edward Fredkin, Stephen Wolfram and others to view the world as a giant computer. There are also connections with recent “digital physics” speculations that the universe might actually be discrete, not continuous. This système du monde is presented as a coherent whole in my book Meta Math!, which will be published this fall.
[1] Vladimir Tasić,et al. Mathematics and the Roots of Postmodern Thought , 2001 .
[2] Jürgen Schmidhuber. The Computational Universe , 2006 .
[3] Hermann Weyl,et al. The Open World , 1934 .
[4] A MINIMAL MODEL FOR QUANTUM GRAVITY , 2004, gr-qc/0409069.
[5] R. Bousso. The Holographic principle , 2002, hep-th/0203101.
[6] Thomas Tymoczko. New Directions in the Philosophy of Mathematics , 1985 .