Irreducible Complexity in Pure Mathematics

Simple item page
dc.creatorChaitin, G. J.
dc.date2004-11-04
dc.date.accessioned2026-07-07T05:13:58Z
dc.date.available2026-07-07T05:13:58Z
dc.descriptionBy 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0411091
dc.identifierhttp://arxiv.org/abs/math/0411091
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73106
dc.subjectHistory and Overview
dc.subject68Q30
dc.titleIrreducible Complexity in Pure Mathematics
dc.typetext

Files

Collections

arXiv