The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

Simple item page
dc.creatorChaitin, G. J.
dc.date2006-11-23
dc.date.accessioned2026-07-07T07:33:17Z
dc.date.available2026-07-07T07:33:17Z
dc.descriptionSome Goedel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. [Enriques lecture given Monday, October 30, 2006, at the University of Milan.]
dc.identifierhttps://arxiv.org/abs/math/0611740
dc.identifierhttp://arxiv.org/abs/math/0611740
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119400
dc.subjectHistory and Overview
dc.subject68Q30
dc.titleThe Halting Probability Omega: Irreducible Complexity in Pure Mathematics
dc.typetext

Files

Collections

arXiv