Abstract
Leibniz in 1686 in his Discours de mtaphysique 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 Gdel’s work on incompleteness and Turing’s work on uncomputability.This will be a first-person account of some doubts and speculations about the nature of mathematics that I have entertained for the past three decades.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Chaitin, G. (2010). Leibniz, Complexity and Incompleteness. In: Carsetti, A. (eds) Causality, Meaningful Complexity and Embodied Cognition. Theory and Decision Library A:, vol 46. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3529-5_7
Download citation
DOI: https://doi.org/10.1007/978-90-481-3529-5_7
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3528-8
Online ISBN: 978-90-481-3529-5
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)