Gregory Chaitin

From Vero - Wikipedia
Revision as of 01:21, 20 November 2025 by imported>LeibnizOmega (Fix nationality and bad link to Chaitin research timeline)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Use dmy dates Template:Infobox scientist

Gregory John Chaitin (Template:IPAc-en Template:Respell; 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.<ref>Review of Meta Math!: The Quest for Omega, By Gregory Chaitin SIAM News, Volume 39, Number 1, January/February 2006</ref> 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.<ref>Panu Raatikainen, "Exploring Randomness and The Unknowable" Notices of the American Mathematical Society Book Review October 2001.</ref> 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.<ref>Template:Cite book</ref><ref>R. Downey, and D. Hirschfeldt (2010), Algorithmic Randomness and Complexity, Springer-Verlag.</ref> 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.

Mathematics and computer science

Gregory Chaitin is Jewish. He attended the Bronx High School of Science and the City College of New York, where he (still in his teens) developed the theory that led to his independent discovery of algorithmic complexity.<ref>Template:Citation</ref><ref>Template:Citation</ref>

In 1975 Chaitin 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, with asymptotic approximations from below (but not from above), but not computable.

Chaitin is also the originator of using graph coloring to do register allocation in compiling, a process known as Chaitin's algorithm.<ref>G.J. Chaitin, Register Allocation and Spilling via Graph Coloring, US Patent 4,571,678 (1986) [cited from Register Allocation on the Intel® Itanium® Architecture, p.155]</ref>

He was formerly a researcher at IBM's Thomas J. Watson Research Center in New York, where he wrote more than 10 books that have been translated into about 15 languages.

In recent years Chaitin has been interested in questions of metabiology and information-theoretic formalizations of the theory of evolution, and he was one of the founding members of the Institute for Advanced Studies at Mohammed VI Polytechnic University in Morocco.

Other scholarly contributions

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).

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 show there are "mathematical facts that are true for no reason, that are true by accident".<ref>Template:Cite arXiv</ref> Chaitin proposes that mathematicians must abandon any hope of proving those mathematical facts and adopt a quasi-empirical methodology.

Honors

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. In 2007 he was given a Leibniz Medal<ref>Zenil, Hector "Leibniz medallion comes to life after 300 years" Anima Ex Machina, The Blog of Hector Zenil, 3 November 2007.</ref> by Wolfram Research; the medal was designed by Stephen Wolfram and Hector Zenil, using Chaitin’s number calculated by Cristian Calude. In 2009 he was given the degree of doctor of philosophy honoris causa by the National University of Córdoba. He was formerly a researcher at IBM's Thomas J. Watson Research Center and a professor at the Federal University of Rio de Janeiro.

Bibliography

References

Template:Reflist

Further reading

Template:Wikiquote

Template:Authority control

Retrieved from "https://wiki.sarg.dev/index.php?title=Gregory_Chaitin&oldid=7771"