Skip to content

Gregory Chaitin

Professor, Universidad de Buenos Aires; Mathematician (Emeritus), IBM

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 new incompleteness theorem in reaction to Gödel’s incompleteness theorem.

He attended the Bronx High School of Science and City College of New York, where he (still in his teens) developed the theories that led to his independent discovery of Kolmogorov complexity. Chaitin has defined Chaitin’s constant Ω, a real number whose digits are equidistributed and which is sometimes informally described as an expression of the probability that a random program will halt. Ω has the mathematical property that it is definable but not computable.

Chaitin also writes about philosophy, especially metaphysics and philosophy of mathematics (particularly about epistemological matters in mathematics). In metaphysics, Chaitin claims that algorithmic information theory is the key to solving problems in the field of biology (obtaining a formal definition of ‘life’, its origin and evolution) and neuroscience (the problem of consciousness and the study of the mind).

Topic Series


Proving Darwin: Making Biology Mathematical

Buy the Book

Meta Math!: The Quest for Omega

Buy the Book

Exploring Randomness (Discrete Mathematics and Theoretical Computer Science)

Buy the Book