American mathematician who 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 section: It might help to add a date, which i assume is late twentieth century for most of his work so far. Also the external web page cited is in New Zealand. Is he really American? Maybe an American currently resident in New Zealand? Or just an American but his fan club is based in New Zealand?
![[Home]](wikipedia.png)