The Limits of Mathematics---Tutorial Version

The latest in a series of reports presenting the information-theoretic incompleteness theorems of algorithmic information theory via algorithms written in specially designed versions of LISP. Previously in this LISP code only one-character identifiers were allowed, and arithmetic had to be programmed out. Now identifiers can be many characters long, and arithmetic with arbitrarily large unsigned decimal integers is built in. This and many other changes in the software have made this material much easier to understand and to use.

By: G. J. Chaitin

Published in: RC20190 in 1995


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .