Irreducible Complexity in Pure Mathematics

Abstract

By using ideas on complexity and randomness originally suggested by the mathematician-philosopher Gottfried Leibniz in 1686, the modern theory of algorithmic information is able to show that there can never be a "theory of everything" for all of mathematics.

13 pages

Cited by in corpus (4)

• Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem
• Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions
• The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence
• The Relation between Disentangled States and Algorithmic Information Theory