Gregory Chaitin
About
Gregory John Chaitin ( 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. 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. 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.
Key details
| Born |
15 November 1947 (age 77) Argentina
|
| Zodiac | Scorpio |
| Tags | Add tag |
Partner
Family members
Romantic interests
Friends & associates
Scholars
Missing information for Gregory Chaitin
- missing gender
- missing height
- missing hair color
- missing eye color
- missing ethnicity
- add profile photo
- add banner photo
- add photos to gallery
- missing current partner
Similar profiles
Activity
Top contributors today
Tags
Featured contributors
Couples by country
USA · UK · Canada · Australia · France · Germany · India · China · South Korea · Japan · Spain · MexicoCouples by decade
1900s · 1910s · 1920s · 1930s · 1940s · 1950s · 1960s · 1970s · 1980s · 1990s · 2000s · 2010s · 2020s
