Algorithmic information theory (AIT) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously. The basic idea is to measure the complexity of an object by the size in bits of the smallest program for computing it. (G. J. Chaitin)

• Gregory Chaitin's homepage → http://www.cs.auckland.ac.nz/CDMTCS/chaitin/
• Wikipedia entry http://www.wikipedia.com/wiki/Algorithmic_information_theory
• citeseer http://citeseer.nj.nec.com/chaitin77algorithmic.html

notes

• http://www.cwi.nl/~tromp/cl/cl.html
• http://www.cs.auckland.ac.nz/CDMTCS/chaitin/eesti.html

see also: Andrey Kolmogorov, Gregory Chaitin, Claude Shannon

Libarynth > Main Web > TheoryOfAlgorithms > AlgorithmicInformationTheory r3 - 25 Mar 2003 - 10:10