Gregory Chaitin

HomePage | Recent changes | View source | Discuss this page | Page history | Log in |

Printable version | Disclaimers | Privacy policy

American contemporary mathematician who, beginning in the late 1960s, has made important contributions to algorithmic information theory, in particular a new incompleteness theorem similar in spirit to Gödel's incompleteness theorem.

Chaitin also defined Chaitin's constant Ω, a real number whose digits are randomly distributed and which expresses the probability that a random program will halt.

Chaitin's work on algorithmic information theory paralleled the work of Kolmogorov in many respects.

See also his website http://www.cs.auckland.ac.nz/CDMTCS/chaitin/


/Talk