Epistemology as Information Theory: From Leibniz to Omega
G. J. Chaitin (IBM Research)

TL;DR
This paper explores the intersection of epistemology and information theory, discussing how concepts like Kolmogorov complexity and Omega relate to the nature of mathematical and physical reality, emphasizing the limits of knowledge.
Contribution
It introduces a 'digital philosophy' framework connecting algorithmic information theory with metaphysical questions about the universe's discreteness and unknowability.
Findings
Omega's bits are maximally unknowable facts
Links between algorithmic information theory and physical universe models
Proposes a coherent 'digital philosophy' perspective
Abstract
In 1686 in his Discours de Metaphysique, 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 Godel's work on incompleteness and Turing's work on uncomputability. Of particular interest is the halting probability Omega, 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 systeme du monde is presented as a coherent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Philosophy and History of Science · Cognitive Science and Education Research
