An Invitation to Algorithmic Information Theory
G. J. Chaitin
Abstract
I'll outline the latest version of my limits of math course. The purpose of this course is to illustrate the proofs of the key information-theoretic incompleteness theorems of algorithmic information theory by means of algorithms written in a specially designed version of LISP. The course is now written in HTML with Java applets, and is available at http://www.research.ibm.com/people/c/chaitin/lm . The LISP now used is much friendlier than before, and because its interpreter is a Java applet it will run in the Netscape browser as you browse my limits of math Web site.
Create a lesson
Related papers
Chaotic eigenfunctions in phase space
S. Nonnenmacher, A. Voros
Improved control of delayed measured systems
Jens Christian Claussen, Heinz Georg Schuster
The accurate and comprehensive model of thin fluid flows with inertia on curved substrates
A. J. Roberts, Zhenquan Li
On periodic solutions of a Hamilton-Jacobi equation with periodic forcing
Andrei Sobolevskii
Drifters dispersion in the Adriatic Sea: Lagrangian data and chaotic model
Guglielmo Lacorata, Erik Aurell, Angelo Vulpiani
Generalized multibaker maps for open dissipative systems
Z. Kaufmann, P. Szépfalusy