This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate? Excessive Violence Sexual Content Political / Social
Email Address:
Article Id: WHEBN0000012308 Reproduction Date:
Gregory John Chaitin ( ; 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 curricula.
He attended the Bronx High School of Science and City College of New York, where he (still in his teens) developed the theory that led to his independent discovery of Kolmogorov complexity.^{[2]}^{[3]}
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 is also the originator of using graph coloring to do register allocation in compiling, a process known as Chaitin's algorithm.
He was formerly a researcher at IBM's Thomas J. Watson Research Center in New York and remains an emeritus researcher. He has written more than 10 book titles that have been translated to about 15 languages. He is today interested in questions of metabiology and information-theoretic formalizations of the theory of evolution.
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, 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.
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 by Wolfram Research. 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 is now a professor at the Federal University of Rio de Janeiro.
Some philosophers and logicians strongly disagree with the philosophical conclusions that Chaitin has drawn from his theorems.^{[4]} The logician Torkel Franzén^{[5]} criticized Chaitin’s interpretation of Gödel's incompleteness theorem and the alleged explanation for it that Chaitin’s work represents.
G.J.Chaitin had finished the Bronx High School of Science, and was an 18-year-old undergraduate student at City College of the City University of New York, when he submitted two papers.... In his [second] paper, Chaitin puts forward the notion of Kolmogorov complexity....
New York City, United States, American Civil War, Hawaii, Western United States
Medicine, Ecology, Molecular biology, Botany, Metabolism
Statistics, Computer science, Epistemology, Regression analysis, Kolmogorov complexity
Cryptography, Artificial intelligence, Software engineering, Science, Machine learning
Bertrand Russell, Socrates, Truth, Plato, Immanuel Kant
Computer science, Halting problem, Probability, Gregory Chaitin, Jürgen Schmidhuber
Mathematics, Philosophy of mathematics, Foundations of mathematics, Alan Turing, Physics
Metaphysics, Aesthetics, Epistemology, Philosophy, Ethics
Bertrand Russell, Logic, Paradox, Oxford, Word
Statistics, Pi, Chaos theory, Quantum mechanics, Game theory