Irreducible Complexity in Pure Mathematics
G. J. Chaitin
math.HOarXiv:math/0411091
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.
Create a lesson
Related papers
Chebyshev and garment cutting. Debunking some myths
Victor Tapia
The suppression thesis in Riemann's Habilitationsvortrag
Victor Tapia
Remembering Solomon Marcus
Florin Nichita
The Erdős--Sós Theorem
David R. Wood
Math for AI safety: an invitation for mathematicians
Lionel Levine
Immensely Questionable Tests
Siyona Agarwal, Julian Bernhoft, Karam Gill et al.