Foundations of Mathematics
| dc.creator | Chaitin, G. J. | |
| dc.date | 2002-03-01 | |
| dc.date | 2002-03-02 | |
| dc.date.accessioned | 2026-07-07T04:46:45Z | |
| dc.date.available | 2026-07-07T04:46:45Z | |
| dc.description | This article discusses what can be proved about the foundations of mathematics using the notions of algorithm and information. The first part is retrospective, and presents a beautiful antique, Godel's proof, the first modern incompleteness theorem, Turing's halting problem, and a piece of postmodern metamathematics, the halting probability Omega. The second part looks forward to the new century and discusses the convergence of theoretical physics and theoretical computer science and hopes for a theoretical biology, in which the notions of algorithm and information are again crucial. | |
| dc.identifier | https://arxiv.org/abs/math/0203002 | |
| dc.identifier | http://arxiv.org/abs/math/0203002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63462 | |
| dc.subject | History and Overview | |
| dc.subject | 03-03 (Primary) 01-02, 68Q30 (Secondary) | |
| dc.title | Foundations of Mathematics | |
| dc.type | text |