This condensed version of chao-dyn/9509010 will be the main hand-out for a
course on algorithmic information theory to be given 22-29 May 1996 at the
Rovaniemi Institute of Technology, Rovaniemi, Finland (see announcement at
http://www.rotol.fi/ ).Comment: LaTeX, 45 page

Chaitin Ibm Box

G. J. Chaitin

English

arXiv

This paper is reprinted in my book Information-Theoretic Incompleteness,  World Scientific, 1992. As is shown in this course, the algorithms considered in the proofs of these two theorems are now easy to program and run, and by looking at the size in bits of these programs one can actually, for the first time, determine exact values for the constants c and 

CiteSeerX

The Limits of Mathematics

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.286.5186

The Limits of Mathematics

Abstract

Similar works

Full text

Available Versions

CiteSeerX