The limits of mathematics course outline and software

  • G. J. Chaitin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 888)


A remarkable new definition of a self-delimiting universal Turing machine is presented that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory. This new universal Turing machine is implemented via software written in Mathematica and C. Using this new software, it is now possible give a self-contained “hands on” mini-course presenting very concretely the latest proofs of the fundamental information-theoretic incompleteness theorems. (To obtain this 127-page report in LATEX via e-mail, please contact chaitin at

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • G. J. Chaitin
    • 1
  1. 1.IBM ResearchYorktown HeightsUSA

Personalised recommendations