Chaitin, Gregory J.
Overview
Works:  76 works in 359 publications in 4 languages and 7,523 library holdings 

Genres:  Interviews Filmed interviews Educational films Popular works 
Roles:  Author, Author of introduction, Honoree 
Publication Timeline
.
Most widely held works about
Gregory J Chaitin
 Conversations with a mathematician : math, art, science, and the limits of reason : a collection of his most wideranging and nontechnical lectures and interviews by Gregory J Chaitin( Book )
Most widely held works by
Gregory J Chaitin
Randomness and complexity : from Leibniz to Chaitin by
Cristian Calude(
)
12 editions published in 2007 in English and held by 1,484 WorldCat member libraries worldwide
The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin's 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays. Sample Chapter(s) Chapter 1: On Random and HardtoDescribe Numbers (902 KB) Contents: <ul><li>On Random and HardtoDescribe Numbers (C H Bennett) </li><li>The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law (P C W Davies) </li><li>What is a Computation?>
12 editions published in 2007 in English and held by 1,484 WorldCat member libraries worldwide
The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin's 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays. Sample Chapter(s) Chapter 1: On Random and HardtoDescribe Numbers (902 KB) Contents: <ul><li>On Random and HardtoDescribe Numbers (C H Bennett) </li><li>The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law (P C W Davies) </li><li>What is a Computation?>
Thinking about Gödel and Turing : essays on complexity, 19702007 by
Gregory J Chaitin(
)
20 editions published between 2007 and 2008 in English and held by 1,033 WorldCat member libraries worldwide
Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Godel and Turing. This book contains 23 nontechnical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of programsize complexity or algorithmic information content in order to shed further light on the fundamental work of Godel and Turing on the limits of mathematical methods, both in logic and in computation. Chaitin argues here that his informationtheoretic approach to metamathematics suggests a quasiempirical view of mathematics that emphasizes the similarities rather than the differences between mathematics and physics. He also develops his own brand of digital philosophy, which views the entire universe as a giant computation, and speculates that perhaps everything is discrete software, everything is 0's and 1's. Chaitin's fundamental mathematical work will be of interest to philosophers concerned with the limits of knowledge and to physicists interested in the nature of complexity
20 editions published between 2007 and 2008 in English and held by 1,033 WorldCat member libraries worldwide
Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Godel and Turing. This book contains 23 nontechnical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of programsize complexity or algorithmic information content in order to shed further light on the fundamental work of Godel and Turing on the limits of mathematical methods, both in logic and in computation. Chaitin argues here that his informationtheoretic approach to metamathematics suggests a quasiempirical view of mathematics that emphasizes the similarities rather than the differences between mathematics and physics. He also develops his own brand of digital philosophy, which views the entire universe as a giant computation, and speculates that perhaps everything is discrete software, everything is 0's and 1's. Chaitin's fundamental mathematical work will be of interest to philosophers concerned with the limits of knowledge and to physicists interested in the nature of complexity
Meta math! : the quest for omega by
Gregory J Chaitin(
Book
)
32 editions published between 2005 and 2008 in English and held by 852 WorldCat member libraries worldwide
Explores the enigmas, paradoxes, and random qualities that exist within the field of mathematics and discusses the author's groundbreaking discovery of the Omega number, a complex representation of unknowability
32 editions published between 2005 and 2008 in English and held by 852 WorldCat member libraries worldwide
Explores the enigmas, paradoxes, and random qualities that exist within the field of mathematics and discusses the author's groundbreaking discovery of the Omega number, a complex representation of unknowability
Algorithmic information theory by
Gregory J Chaitin(
Book
)
53 editions published between 1977 and 2004 in English and Undetermined and held by 719 WorldCat member libraries worldwide
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a socalled exponential diophantine equation
53 editions published between 1977 and 2004 in English and Undetermined and held by 719 WorldCat member libraries worldwide
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a socalled exponential diophantine equation
The limits of mathematics : a course on information theory and limits of formal reasoning by
Gregory J Chaitin(
Book
)
36 editions published between 1997 and 2014 in English and held by 537 WorldCat member libraries worldwide
"This book presents the final version of Chaitin's course on the limits of mathematical reasoning. This course uses algorithmic information theory to show that mathematics has serious limitations, and features a new more didactic approach to algorithmic information theory using LISP and Mathematica software. The thesis of the book is that the incompleteness phenomenon discovered by Godel is much more widespread and serious than hitherto suspected."Jacket
36 editions published between 1997 and 2014 in English and held by 537 WorldCat member libraries worldwide
"This book presents the final version of Chaitin's course on the limits of mathematical reasoning. This course uses algorithmic information theory to show that mathematics has serious limitations, and features a new more didactic approach to algorithmic information theory using LISP and Mathematica software. The thesis of the book is that the incompleteness phenomenon discovered by Godel is much more widespread and serious than hitherto suspected."Jacket
Proving Darwin : making biology mathematical by
Gregory J Chaitin(
Book
)
6 editions published between 2012 and 2013 in English and held by 423 WorldCat member libraries worldwide
Explains how evolution works on a mathematical level, arguing that mathematical theory is an essential part of evolution while highlighting mathematical principles in the biological world
6 editions published between 2012 and 2013 in English and held by 423 WorldCat member libraries worldwide
Explains how evolution works on a mathematical level, arguing that mathematical theory is an essential part of evolution while highlighting mathematical principles in the biological world
Information, randomness & incompleteness : papers on algorithmic information theory by
Gregory J Chaitin(
Book
)
24 editions published between 1987 and 1990 in English and Italian and held by 403 WorldCat member libraries worldwide
Pt. I. Introductory/tutorial/survey papers. Randomness and mathematical proof, Scientific American, 1975. On the difficulty of computations, IEEE transactions on information theory, 1970. Informationtheoretic computational complexity, IEEE transactions on information theory, 1974. Algorithmic information theory, encyclopedia of statistical sciences, 1982. Algorithmic information theory, IBM Journal of Research and Development, 1977  pt. II. Applications to metamathematics. Gödel's theorem and information, International Journal of Theoretical Physics, 1982. Randomness and Gödel's theorem, Proceedings 1985/Solvay Conference, in press. An algebraic equation for the halting probability, The Universal Turing Machine, in press. Computing the busy beaver function, Open Problems in Communication and Computation, in press  pt. III. Applications to biology. To a mathematical definition of "life", ACM SICACT News, 1970. Toward a mathematical definition of "life", The Maximum Entropy Formalism, 1979. pt IV. Technical papers on selfdelimiting programs. A theory of program size formally identical to information theory, Journal of the ACM, 1975. Incompleteness theorems for random reals, Advances in Applied Mathematics, 1987. Algorithmic entropy of sets, Computers & Mathematics with Applications, 1976. pt. V. Technical papers on blankendmarker programs. Informationtheoretic limitations of formal systems, Journal of the ACM, 1974. A note on Monte Carlo primality tests and algorithmic information theory, Communications on Pure and Applied Mathematics, 1978. Informationtheoretic characterizations of recursive infinite strings, Theoretical Computer Science, 1976. Program size, oracles, and the jump operation, Osaka Journal of Mathematics, 1977  pt. VI. Technical papers on turing machines. On the length of programs for computing finite binary sequences, Journal of the ACM, 1966. On the length of programs for computing finite binary sequences: statistical considerations, Journal of the ACM, 1969. On the simplicity and speed of programs for computing infinite sets of natural numbers, Journal of the ACM, 1969
24 editions published between 1987 and 1990 in English and Italian and held by 403 WorldCat member libraries worldwide
Pt. I. Introductory/tutorial/survey papers. Randomness and mathematical proof, Scientific American, 1975. On the difficulty of computations, IEEE transactions on information theory, 1970. Informationtheoretic computational complexity, IEEE transactions on information theory, 1974. Algorithmic information theory, encyclopedia of statistical sciences, 1982. Algorithmic information theory, IBM Journal of Research and Development, 1977  pt. II. Applications to metamathematics. Gödel's theorem and information, International Journal of Theoretical Physics, 1982. Randomness and Gödel's theorem, Proceedings 1985/Solvay Conference, in press. An algebraic equation for the halting probability, The Universal Turing Machine, in press. Computing the busy beaver function, Open Problems in Communication and Computation, in press  pt. III. Applications to biology. To a mathematical definition of "life", ACM SICACT News, 1970. Toward a mathematical definition of "life", The Maximum Entropy Formalism, 1979. pt IV. Technical papers on selfdelimiting programs. A theory of program size formally identical to information theory, Journal of the ACM, 1975. Incompleteness theorems for random reals, Advances in Applied Mathematics, 1987. Algorithmic entropy of sets, Computers & Mathematics with Applications, 1976. pt. V. Technical papers on blankendmarker programs. Informationtheoretic limitations of formal systems, Journal of the ACM, 1974. A note on Monte Carlo primality tests and algorithmic information theory, Communications on Pure and Applied Mathematics, 1978. Informationtheoretic characterizations of recursive infinite strings, Theoretical Computer Science, 1976. Program size, oracles, and the jump operation, Osaka Journal of Mathematics, 1977  pt. VI. Technical papers on turing machines. On the length of programs for computing finite binary sequences, Journal of the ACM, 1966. On the length of programs for computing finite binary sequences: statistical considerations, Journal of the ACM, 1969. On the simplicity and speed of programs for computing infinite sets of natural numbers, Journal of the ACM, 1969
The unknowable by
Gregory J Chaitin(
Book
)
23 editions published between 1999 and 2001 in English and Japanese and held by 385 WorldCat member libraries worldwide
"This companion volume to Chaitin's "The Limits of Mathematics", also published by Springer, gives a historical survey of the work this century on the foundations of mathematics, in which the author was a major participant. "The Unknowable" is a readable and concrete introduction to Chaitin's ideas, and it includes a detailed explanation of the programming language used by Chaitin in both volumes. It will enable computer users to interact with the author's proofs and discover for themselves how they work. The software for "The Unknowable" can be downloaded from the author's Web site."Jacket
23 editions published between 1999 and 2001 in English and Japanese and held by 385 WorldCat member libraries worldwide
"This companion volume to Chaitin's "The Limits of Mathematics", also published by Springer, gives a historical survey of the work this century on the foundations of mathematics, in which the author was a major participant. "The Unknowable" is a readable and concrete introduction to Chaitin's ideas, and it includes a detailed explanation of the programming language used by Chaitin in both volumes. It will enable computer users to interact with the author's proofs and discover for themselves how they work. The software for "The Unknowable" can be downloaded from the author's Web site."Jacket
Exploring randomness by
Gregory J Chaitin(
Book
)
18 editions published between 2000 and 2002 in English and held by 378 WorldCat member libraries worldwide
This essential companion volume to CHAITIN's highly successful books The Unknowable and The Limits of Mathematics, also published by Springer, presents the technical core of his theory of programsize complexity, also known as algorithmic information theory. (The two previous volumes are more concerned with applications to metamathematics.) LISP is used to present the key algorithms and to enable computer users to interact with the author's proofs and discover for themselves how they work. The LISP code for this book is available at the author's Web site together with a Java applet LISP interpreter: http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ait/ "No one has looked deeper and farther into the abyss of randomness and its role in mathematics than Greg Chaitin. This book tells you everything he's seen. Don't miss it." John Casti, Santa Fe Institute, Author of "Goedel: A Life of Logic."
18 editions published between 2000 and 2002 in English and held by 378 WorldCat member libraries worldwide
This essential companion volume to CHAITIN's highly successful books The Unknowable and The Limits of Mathematics, also published by Springer, presents the technical core of his theory of programsize complexity, also known as algorithmic information theory. (The two previous volumes are more concerned with applications to metamathematics.) LISP is used to present the key algorithms and to enable computer users to interact with the author's proofs and discover for themselves how they work. The LISP code for this book is available at the author's Web site together with a Java applet LISP interpreter: http://www.cs.auckland.ac.nz/CDMTCS/chaitin/ait/ "No one has looked deeper and farther into the abyss of randomness and its role in mathematics than Greg Chaitin. This book tells you everything he's seen. Don't miss it." John Casti, Santa Fe Institute, Author of "Goedel: A Life of Logic."
Gödel's way : exploits into an undecidable world by
Gregory J Chaitin(
Book
)
9 editions published between 2011 and 2012 in English and Undetermined and held by 325 WorldCat member libraries worldwide
"This accessible book gives a new detailed and elementary proof of the Gödel incompleteness theorems and then presents the Chaitin results and their relation to the da CostaDoria results, which are given in full, but with no technicalities. Besides theory, the lively historical report, the personal stories about the main character, and the writing process of this volume make it appealing leisure reading for those interested in mathematics, logic, physics, philosophy and computer sciences"
9 editions published between 2011 and 2012 in English and Undetermined and held by 325 WorldCat member libraries worldwide
"This accessible book gives a new detailed and elementary proof of the Gödel incompleteness theorems and then presents the Chaitin results and their relation to the da CostaDoria results, which are given in full, but with no technicalities. Besides theory, the lively historical report, the personal stories about the main character, and the writing process of this volume make it appealing leisure reading for those interested in mathematics, logic, physics, philosophy and computer sciences"
Informationtheoretic incompleteness by
Gregory J Chaitin(
Book
)
6 editions published between 1992 and 1998 in English and held by 152 WorldCat member libraries worldwide
In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a nontechnical discussion of its significance. The volume is an essential companion to the earlier collection of Chaitin's papers Information, Randomness and Incompleteness, also published by World Scientific. The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin's most fundamental informationtheoretic incompleteness theorems. The nontechnical part includes the lecture given by Chaitin in Gšdel's classroom at the University o
6 editions published between 1992 and 1998 in English and held by 152 WorldCat member libraries worldwide
In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a nontechnical discussion of its significance. The volume is an essential companion to the earlier collection of Chaitin's papers Information, Randomness and Incompleteness, also published by World Scientific. The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin's most fundamental informationtheoretic incompleteness theorems. The nontechnical part includes the lecture given by Chaitin in Gšdel's classroom at the University o
Conversations with a mathematician : math, art, science, and the limits of reason : a collection of his most wideranging
and nontechnical lectures and interviews by
Gregory J Chaitin(
Book
)
14 editions published between 2001 and 2003 in English and held by 114 WorldCat member libraries worldwide
G.J. Chaitin is at the IBM Thomas J. Watson Research Center in New York. He has shown that God plays dice not only in quantum mechanics, but even in the foundations of mathematics, where Chaitin discovered mathematical facts that are true for no reason, that are true by accident. This book collects his most wideranging and nontechnical lectures and interviews, and it will be of interest to anyone concerned with the philosophy of mathematics, with the similarities and differences between physics and mathematics, or with the creative process and mathematics as an art. "Chaitin has put a scratch on the rock of eternity." Jacob T. Schwartz, Courant Institute, New York University, USA "(Chaitin is) one of the great ideas men of mathematics and computer science." Marcus Chown, author of The Magic Furnace, in NEW SCIENTIST "Finding the right formalization is a large component of the art of doing great mathematics." John Casti, author of Mathematical Mountaintops, on Godel, Turing and Chaitin in NATURE "What mathematicians over the centuries  from the ancients, through Pascal, Fermat, Bernoulli, and de Moivre, to Kolmogorov and Chaitin  have discovered, is that it ÄrandomnessÜ is a profoundly rich concept." Jerrold W. Grossman in the MATHEMATICAL INTELLIGENCER
14 editions published between 2001 and 2003 in English and held by 114 WorldCat member libraries worldwide
G.J. Chaitin is at the IBM Thomas J. Watson Research Center in New York. He has shown that God plays dice not only in quantum mechanics, but even in the foundations of mathematics, where Chaitin discovered mathematical facts that are true for no reason, that are true by accident. This book collects his most wideranging and nontechnical lectures and interviews, and it will be of interest to anyone concerned with the philosophy of mathematics, with the similarities and differences between physics and mathematics, or with the creative process and mathematics as an art. "Chaitin has put a scratch on the rock of eternity." Jacob T. Schwartz, Courant Institute, New York University, USA "(Chaitin is) one of the great ideas men of mathematics and computer science." Marcus Chown, author of The Magic Furnace, in NEW SCIENTIST "Finding the right formalization is a large component of the art of doing great mathematics." John Casti, author of Mathematical Mountaintops, on Godel, Turing and Chaitin in NATURE "What mathematicians over the centuries  from the ancients, through Pascal, Fermat, Bernoulli, and de Moivre, to Kolmogorov and Chaitin  have discovered, is that it ÄrandomnessÜ is a profoundly rich concept." Jerrold W. Grossman in the MATHEMATICAL INTELLIGENCER
Pioneers. against method(
Visual
)
1 edition published in 2016 in English and held by 86 WorldCat member libraries worldwide
Gregory Chaitin (b. 1947) is a mathematician, an expert in complexity. Already as a young prodigy he contributed greatly to the philosophy of mathematics and computer science. Chaitin states that although there are truths in science that cannot be proven, there is reason for huge optimism. He sketches a theory of the source of beauty and creativity in nature. We'll be meeting Chaitin at the tiny Brazilian island of Paqueta, his philosophical retreat. About the Series: Pioneers is one and only film project devoted to the most unorthodox contemporary thinkers who have had the courage to challenge current paradigms. The emotions of discovering and stresstesting new theories; the passion which prompts one to go against the expectations of others, against the "publish or die" model; the joys and sorrows of exploring frontiers of the known and the unknown  this is what Pioneers is about
1 edition published in 2016 in English and held by 86 WorldCat member libraries worldwide
Gregory Chaitin (b. 1947) is a mathematician, an expert in complexity. Already as a young prodigy he contributed greatly to the philosophy of mathematics and computer science. Chaitin states that although there are truths in science that cannot be proven, there is reason for huge optimism. He sketches a theory of the source of beauty and creativity in nature. We'll be meeting Chaitin at the tiny Brazilian island of Paqueta, his philosophical retreat. About the Series: Pioneers is one and only film project devoted to the most unorthodox contemporary thinkers who have had the courage to challenge current paradigms. The emotions of discovering and stresstesting new theories; the passion which prompts one to go against the expectations of others, against the "publish or die" model; the joys and sorrows of exploring frontiers of the known and the unknown  this is what Pioneers is about
Hasard et complexité en mathématiques by
Gregory J Chaitin(
Book
)
2 editions published in 2009 in French and held by 79 WorldCat member libraries worldwide
2 editions published in 2009 in French and held by 79 WorldCat member libraries worldwide
The limits of mathematics by
Gregory J Chaitin(
Book
)
9 editions published between 1994 and 2001 in English and Japanese and held by 23 WorldCat member libraries worldwide
Abstract: "This condensed version of RC 20190 will be the main handout for a course on algorithmic information theory to be given 2229 May 1996 at the Rovaniemi Institute of Technology, Rovaniemi, Finland (see announcement at http://www.rotol.fi)."
9 editions published between 1994 and 2001 in English and Japanese and held by 23 WorldCat member libraries worldwide
Abstract: "This condensed version of RC 20190 will be the main handout for a course on algorithmic information theory to be given 2229 May 1996 at the Rovaniemi Institute of Technology, Rovaniemi, Finland (see announcement at http://www.rotol.fi)."
Logica matematica : strutture rappresentazioni deduzioni by
Vincenzo Manca(
Book
)
2 editions published in 2001 in Italian and held by 17 WorldCat member libraries worldwide
2 editions published in 2001 in Italian and held by 17 WorldCat member libraries worldwide
Alla ricerca di omega by
Gregory J Chaitin(
Book
)
1 edition published in 2007 in Italian and held by 11 WorldCat member libraries worldwide
1 edition published in 2007 in Italian and held by 11 WorldCat member libraries worldwide
Information and randomness : an algorithmic perspective by
Cristian Calude(
Book
)
6 editions published between 1994 and 2002 in English and held by 10 WorldCat member libraries worldwide
The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge. "Professor Calude has produced a firstrate exposition of uptodate work in information and randomness." D.S. Bridges, Canterbury University, coauthor, with Errett Bishop, of Constructive Analysis; "The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician; "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics
6 editions published between 1994 and 2002 in English and held by 10 WorldCat member libraries worldwide
The book presents in a mathematical clear way the fundamentals of algorithmic information theory and a few selected applications. This 2nd edition presents new and important results obtained in recent years: the characterization of computable enumerable random reals, the construction of an Omega Number for which ZFC cannot determine any digits, and the first successful attempt to compute the exact values of 64 bits of a specific Omega Number. Finally, the book contains a discussion of some interesting philosophical questions related to randomness and mathematical knowledge. "Professor Calude has produced a firstrate exposition of uptodate work in information and randomness." D.S. Bridges, Canterbury University, coauthor, with Errett Bishop, of Constructive Analysis; "The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician; "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics
Informationtheoretic incompleteness by
Gregory J Chaitin(
Book
)
3 editions published between 1992 and 1998 in English and Undetermined and held by 9 WorldCat member libraries worldwide
3 editions published between 1992 and 1998 in English and Undetermined and held by 9 WorldCat member libraries worldwide
Teoria algoritmica della complessità by
Gregory J Chaitin(
Book
)
1 edition published in 2006 in Italian and held by 8 WorldCat member libraries worldwide
1 edition published in 2006 in Italian and held by 8 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Biology BiologyMathematical models BiologyPhilosophy Biomathematics Chaitin, Gregory J Coding theory Combinatorial analysis Computational complexity Computer algorithms Computer programming Computer programmingPhilosophy Computer science Computer scienceMathematics Computer software Distribution (Probability theory) Electronic data processing Evolution (Biology)Mathematical models Evolution (Biology)Mathematics Evolution (Biology)Philosophy EvolutionMathematical models EvolutionMathematics EvolutionPhilosophy Gödel, Kurt Gödel's theorem Incompleteness theorems Information theory Information theory in mathematics Kolmogorov complexity LISP (Computer program language) Logic, Symbolic and mathematical Machine theory Mathematicians Mathematics MathematicsPhilosophy Metamathematics Philosophy Reasoning Statistics Stochastic processes Turing, Alan, Turing machines
Covers
Alternative Names
Chaitin, G. J.
Chaitin, G. J. 1947
Chaitin, G. J. (Gregory J.)
Chaitin , Gregory
Chaitin, Gregory 1947
Chaitin, Gregory J.
Chaitin, Gregory John
Chaitin, Gregory John 1947
Gregori Dzon Cejtin
Gregory Chaitin Amerikaans wiskundige
Gregory Chaitin amerikansk datavetare och matematiker
Gregory Chaitin amerikansk informatikar og matematikar
Gregory Chaitin amerikansk informatiker og matematiker
Gregory Chaitin matematico e informatico argentino naturalizzato statunitense
Gregory Chaitin mathématicien américain
Gregory Chaitin USamerikanischer Mathematiker
Хайтин, Грегори
غريغوري تشايتين
گرگوری چیتین ریاضیدان و دانشمند علوم کامپیوتر آمریکایی
그레고리 카이틴
グレゴリー・チャイティン
チャイティン, G. J
チャイティン, グレゴリー
チャイティン, グレゴリー・J
格里戈里·蔡廷 美国数学家
Languages