![]() ![]() Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy. Gregory John Chaitin (/tatn/ CHY-tin born 25 June 1947) is an Argentine-American mathematician and computer scientist. ![]() It is a common subject in several computer science curricula. Solomonoff, Kolmogorov, Martin-Löf, and Leonid Levin, algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. ![]() 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. ![]() 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. A collection of interviews with Greg Chaitin, the creator of Algorithmic Information Theory G. What also emerges clearly is the joy he finds in his work, along with positive attitudes towards findings that have been interpreted by some as negative, even. His style in both of these settings is extremely clear and personable. Gregory John Chaitin ( / ˈ tʃ aɪ t ɪ n/ CHY-tin born 25 June 1947) is an Argentine- American mathematician and computer scientist. 'The book is a collection of non-technical lectures by, and interviews of, the mathematician Gregory J. ![]()
0 Comments
Leave a Reply. |