## ::Gregory Chaitin

### ::concepts

{{#invoke:Infobox|infobox}}

**Gregory John Chaitin** ({{#invoke:IPAc-en|main}} * CHY-tən*; born 15th. November, 1947 in Argentina) 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 Kolmogorov (or Kolmogorov-Chaitin) complexity together with Andrei Kolmogorov and Ray Solomonoff. Today, algorithmic information theory is a common subject in any computer science curriculum.

**Gregory Chaitin sections**

Intro Mathematics and computer science Other scholarly contributions Honors Criticism See also Bibliography Notes References External links

PREVIOUS: Intro | NEXT: Mathematics and computer science |

<< | >> |

Chaitin::category Theory::american Title::leibniz Chaitin::research Computer::citation Del's::given

{{#invoke:Infobox|infobox}}

**Gregory John Chaitin** ({{#invoke:IPAc-en|main}} * CHY-tən*; born 15th. November, 1947 in Argentina) 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 Kolmogorov (or Kolmogorov-Chaitin) complexity together with Andrei Kolmogorov and Ray Solomonoff. Today, algorithmic information theory is a common subject in any computer science curriculum.

**Gregory Chaitin sections**

Intro Mathematics and computer science Other scholarly contributions Honors Criticism See also Bibliography Notes References External links

PREVIOUS: Intro | NEXT: Mathematics and computer science |

<< | >> |