Irreducible Complexity in Pure Mathematics
History and Overview
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0411091,
title = {Irreducible Complexity in Pure Mathematics},
author = {G. J. Chaitin},
journal= {arXiv preprint arXiv:math/0411091},
year = {2007}
}
Comments
13 pages