Foundations of Mathematics
G. J. Chaitin
Abstract
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.
Create a lesson
Related papers
Natural Geometry Based on the Rectilinear Plane
Mohammed Berkani
An oral history of FPSAC
Sam Hopkins
The grounded spirituality of mathematics
Tarik Aougab
From a Student's Question to the Half-Derivative: A Constructivist Teaching Model - Part I
Davit Kapanadze
Short Proofs for the Minimum Number of Determined Circles
Stijn Cambie, Denis Paliy, Rafał Wrona
What the Machine Invented: Mining New Mathematical Instruments from OpenAI's October 2026 Release of AI-Generated Mathematics
Ying Xie