An Invitation to Algorithmic Information Theory
chao-dyn
2008-02-03 v1 Chaotic Dynamics
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.
Cite
@article{arxiv.chao-dyn/9609008,
title = {An Invitation to Algorithmic Information Theory},
author = {G. J. Chaitin},
journal= {arXiv preprint arXiv:chao-dyn/9609008},
year = {2008}
}
Comments
32 pages, LaTeX