Gregory Chaitin
Gregory John Chaitin ( ; born 25 June 1947) is an
Argentine-
American mathematician and
computer scientist. Beginning in the late 1960s, Chaitin made contributions to
algorithmic information theory and
metamathematics, in particular a computer-theoretic result equivalent to
Gödel's incompleteness theorem. He is considered to be one of the founders of what is today known as algorithmic (Solomonoff–Kolmogorov–Chaitin, Kolmogorov or program-size)
complexity together with
Andrei Kolmogorov and
Ray Solomonoff. Along with the works of e.g.
Solomonoff,
Kolmogorov,
Martin-Löf, and
Leonid Levin,
algorithmic information theory became a foundational part of
theoretical computer science,
information theory, and
mathematical logic. It is a common subject in several computer science curricula. Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.
Provided by Wikipedia