Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Mathematics and computer science  





2 Other scholarly contributions  





3 Honors  





4 Criticism  





5 Bibliography  





6 References  





7 Further reading  





8 External links  














Gregory Chaitin






العربية
Català
Deutsch
Ελληνικά
Español
Esperanto
فارسی
Français

Italiano
Kreyòl ayisyen
مصرى
Nederlands

Polski
Português
Русский
Slovenščina
Српски / srpski
Українська
 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 




In other projects  



Wikiquote
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Gregory Chaitin
Chaitin in 2008
Born (1947-06-25) 25 June 1947 (age 77)
NationalityArgentine-American
Known for
  • Chaitin's constant
  • Chaitin's algorithm
  • Scientific career
    Fields
  • Mathematics
  • Computer science
  • Institutions
  • Federal University of Rio de Janeiro
  • University of Buenos Aires
  • IBM T.J. Watson Research Center
  • Websiteuba.academia.edu/GregoryChaitin

    Gregory John Chaitin (/ˈtɪn/ CHY-tin; 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.[2] 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. 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.[3][4] 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[edit]

    Gregory Chaitin is Jewish and 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 algorithmic complexity.[5][6]

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

    Chaitin is also the originator of using graph coloring to do register allocationincompiling, a process known as Chaitin's algorithm.[7]

    He was formerly a researcher at IBM's Thomas J. Watson Research Center in New York. He has written more than 10 books 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, and is a member of the Institute for Advanced Studies at Mohammed VI Polytechnic University.

    Other scholarly contributions[edit]

    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".[8] Chaitin proposes that mathematicians must abandon any hope of proving those mathematical facts and adopt a quasi-empirical methodology.

    Honors[edit]

    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[9]byWolfram 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 a professor at the Federal University of Rio de Janeiro.

    Criticism[edit]

    Some philosophers and logicians disagree with the philosophical conclusions that Chaitin has drawn from his theorems related to what Chaitin thinks is a kind of fundamental arithmetic randomness.[10] The logician Torkel Franzén criticized Chaitin's interpretation of Gödel's incompleteness theorem and the alleged explanation for it that Chaitin's work represents.[11]

    Bibliography[edit]

    References[edit]

  • ^ Calude, C.S. (2002). Information and Randomness: An Algorithmic Perspective. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag.
  • ^ R. Downey, and D. Hirschfeldt (2010), Algorithmic Randomness and Complexity, Springer-Verlag.
  • ^ Li; Vitanyi (1997), An Introduction to Kolmogorov Complexity and Its Applications, Springer, p. 92, ISBN 9780387948683, 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....
  • ^ Chaitin, G. J. (October 1966), "On the Length of Programs for Computing Finite Binary Sequences", Journal of the ACM, 13 (4): 547–569, doi:10.1145/321356.321363, S2CID 207698337
  • ^ 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]
  • ^ Chaitin, G. J. (2003). "From Philosophy to Program Size". arXiv:math/0303352.
  • ^ Zenil, Hector "Leibniz medallion comes to life after 300 years" Anima Ex Machina, The Blog of Hector Zenil, 3 November 2007.
  • ^ Panu Raatikainen, "Exploring Randomness and The Unknowable" Notices of the American Mathematical Society Book Review October 2001.
  • ^ Franzén, Torkel (2005), Gödel's Theorem: An Incomplete Guide to its Use and Abuse, Wellesley, Massachusetts: A K Peters, Ltd., ISBN 978-1-56881-238-0
  • Further reading[edit]

    External links[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Gregory_Chaitin&oldid=1230347493"

    Categories: 
    1947 births
    Living people
    The Bronx High School of Science alumni
    City College of New York alumni
    Argentine mathematicians
    Argentine computer scientists
    20th-century American mathematicians
    21st-century American mathematicians
    American information theorists
    IBM employees
    Philosophers of mathematics
    Epistemologists
    Metaphysics writers
    American logicians
    21st-century American philosophers
    Argentine information theorists
    Mathematicians from New York (state)
    Hidden categories: 
    Webarchive template wayback links
    Wikipedia neutral point of view disputes from June 2024
    All Wikipedia neutral point of view disputes
    Articles with short description
    Short description is different from Wikidata
    Use dmy dates from September 2020
    Articles with hCards
    Wikipedia neutral point of view disputes from July 2016
    CS1 Italian-language sources (it)
    Articles with FAST identifiers
    Articles with ISNI identifiers
    Articles with VIAF identifiers
    Articles with WorldCat Entities identifiers
    Articles with BNE identifiers
    Articles with BNF identifiers
    Articles with BNFdata identifiers
    Articles with CANTICN identifiers
    Articles with GND identifiers
    Articles with ICCU identifiers
    Articles with J9U identifiers
    Articles with KBR identifiers
    Articles with LCCN identifiers
    Articles with Libris identifiers
    Articles with NDL identifiers
    Articles with NKC identifiers
    Articles with NLG identifiers
    Articles with NTA identifiers
    Articles with PLWABN identifiers
    Articles with CINII identifiers
    Articles with DBLP identifiers
    Articles with MATHSN identifiers
    Articles with MGP identifiers
    Articles with ZBMATH identifiers
    Articles with DTBIO identifiers
    Articles with SUDOC identifiers
     



    This page was last edited on 22 June 2024, at 06:10 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki