Irreducible Complexity in Pure Mathematics
Gregory J. Chaitin · arXiv (Cornell University) · 2004
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.