Epistemology as Information Theory: From Leibniz to Omega

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 whole in my book Meta Math!, which will be published this fall.

arXiv commentAlan Turing Lecture on Computing and Philosophy, E-CAP'05

References in corpus (2)

• The Holographic Principle
• Accelerating Observers, Area and Entropy

Cited by in corpus (10)

• Pancomputationalism: Theory or metaphor?
• Elements of Consciousness and Cognition. Biology, Mathematic, Physics and Panpsychism: an Information Topology Perspective
• A Minimal Intervention Definition of Reverse Engineering a Neural Circuit
• Transdisciplinarity seen through Information, Communication, Computation, (Inter-)Action and Cognition
• Life, The Mind, and Everything
• Modeling Life as Cognitive Info-Computation
• The Halting Probability Omega: Irreducible Complexity in Pure Mathematics
• Info-computational constructivism in modelling of life as cognition
• Logic Conditionals, Supervenience, and Selection Tasks
• Anchoring Distributed Agency: Institutional Metaphors for Designing Large-Scale AI and AI Techniques for Running Institutions