META-MATHEMATICS AND THE FOUNDATIONS OF MATHEMATICS

This article discusses what can be proved about the foundations of mathematics using the notions of algorithm and information. The rst part is retrospective, and presents a beautiful antique, G¨odel's proof; the rst modern incompleteness theorem, Turing's halting problem; and a piece of postmodern metamathematics, the halting probability O. The second part looks forward to the new century and discusses the conver-gence of theoretical physics and theoretical computer science and hopes for a theoretical biology, in which the notions of algorithm and information are again crucial.