G J Chaitin

G J Chaitin

Gregory John Chaitin 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.

Back to all authors

Books Authored by G J Chaitin

Algorithmic Information Theory, Third Printing

Post date: 30 Nov 2006
Presents the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs.
Publisher: Cambridge University Press
Publication date: 02 Apr 2003
Document Type: Book
 
Algorithmic Information Theory, Third Printing

Algorithmic Information Theory, Third Printing

Post date: 30 Nov 2006
Presents the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs.
Publisher: Cambridge University Press
Publication date: 02 Apr 2003
Document Type: Book


Book Categories
Sponsors
Icons8, a free icon pack