Irreducible Complexity in Pure Mathematics
classification
🧮 math.HO
keywords
complexitymathematicstheoryablealgorithmiceverythinggottfriedideas
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.