From Wikipedia, the free encyclopedia
(Redirected from G. J. Chaitin)
Gregory J. Chaitin (born 1947) is an Argentine-American mathematician and computer scientist.
Beginning in the late 1960s, Chaitin made important contributions to algorithmic information theory and metamathematics, in particular a new incompleteness theorem similar in spirit to Gödel's incompleteness theorem. He attended the Bronx High School of Science and City College of New York, where he first developed his theorem as a young man.
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's early work on algorithmic information theory paralleled the earlier work of Kolmogorov.
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). Indeed, in recent writings, he defends a position known as digital philosophy. In the epistemology of mathematics, he claims that his findings in mathematical logic and algorithmic information theory shows there are “mathematical facts that are true for no reason, they're true by accident. They are random mathematical facts”. Chaitin proposes that mathematicians must abandon any hope of proving those mathematical facts and adopt a quasi-empirical methodology.
Chaitin's mathematical work is generally agreed to be correct, and has been cited, discussed and continued by many mathematicians. Some philosophers or logicians strongly disagree with his philosophical interpretation of it. Philosopher Panu Raatikainen argues that Chaitin misinterprets the implications of his own work and his conclusions about philosophical matters are not solid. The logician Torkel Franzén criticizes Chaitin’s interpretation of Gödel's Incompleteness Theorem and the alleged explanation for it that Chaitin’s work represent.
Chaitin is also the originator of using graph coloring to do register allocation in compiling, a process known as Chaitin's algorithm
In 1995 he was given the degree of doctor of science honoris causa by the University of Maine. In 2002 he was given the title of honorary professor by the University of Buenos Aires in Argentina, where his parents were born and where Chaitin spent part of his youth. He is a research staff member at IBM's Thomas J. Watson Research Center and also a visiting professor at the Computer Science Department of the University of Auckland, and on the international committee of the Valparaíso Complex Systems Institute.
- Algorithmic Information Theory, (Cambridge University Press, 1987),
- Information, Randomness & Incompleteness, (World Scientific, 1987),
- Information-Theoretic Incompleteness, (World Scientific, 1992),
- The Limits of Mathematics, (Springer-Verlag 1998),
- The Unknowable, (Springer-Verlag 1999),
- Exploring Randomness, (Springer-Verlag 2001),
- Conversations with a Mathematician, (Springer-Verlag 2002),
- From Philosophy to Program Size, (Tallinn Cybernetics Institute 2003),
- Meta Math!: The Quest for Omega, (Pantheon 2005).
This article might use material from a Wikipedia article
, which is released under the Creative Commons Attribution-Share-Alike License 3.0