Gregory Chaitin
Gregory John Chaitin ( ; 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. Provided by Wikipedia
Showing 1 - 7 results of 7 for search 'Chaitin, Gregory', query time: 0.02s
Refine Results
-
1
Metaphysics, Metamathematics and Metabiology by Chaitin, Gregory
Published 2016
conferenceObject -
2
-
3
Los límites de la razón by Chaitin, Gregory J.
Call Number: Loading…
Located: Loading…Article Loading… -
4
Algorithmic information theory / by Chaitin, Gregory J., 1947-
Published 1992Call Number: Loading…
Located: Loading…Book Loading… -
5
Information randomness and incompleteness : papers on algorithmic information theory / by Chaitin, Gregory J., 1947-
Published 1990Call Number: Loading…
Located: Loading…Book Loading… -
6
Algorithmic information theory / by Chaitin, Gregory J. 1947-
Published 1992Call Number: Loading…
Located: Loading…Book Loading… -
7
El número omega : límites y enigmas de las matemáticas / by Chaitin, Gregory J. 1947-
Published 2015Call Number: Loading…
Located: Loading…Book Loading…