A theory of program size formally identical to information theory. Zbl 0309.68045
Chaitin, Gregory J. |
|
1975
|
On the length of programs for computing finite binary sequences. Zbl 0158.25301
Chaitin, Gregory J. |
|
1966
|
Algorithmic information theory. Zbl 0655.68003
Chaitin, Gregory J. |
|
1987
|
Information, randomness and incompleteness. Papers on algorithmic information theory. Zbl 1013.00525
Chaitin, G. J. |
|
1987
|
Algorithmic information theory. Zbl 0362.94035
Chaitin, G. J. |
|
1977
|
On the length of programs for computing finite binary sequences: Statistical considerations. Zbl 0187.28303
Chaitin, G. J. |
|
1969
|
The maximum entropy formalism. A conference held at the Massachusetts Institute of Technology on May 2–4, 1978. Zbl 0467.94001
|
|
1979
|
Information, randomness and incompleteness. Papers on algorithmic information theory.
2nd ed. Zbl 1015.00502
Chaitin, G. J. |
|
1990
|
Information-theoretic characterizations of recursive infinite strings. Zbl 0328.02029
Chaitin, Gregory J. |
|
1976
|
Incompleteness theorems for random reals. Zbl 0649.03046
Chaitin, G. J. |
|
1987
|
Information-theoretic limitations of formal systems. Zbl 0287.68027
Chaitin, Gregory J. |
|
1974
|
Gödel’s theorem and information. Zbl 1016.03501
Chaitin, Gregory J. |
|
1982
|
The unknowable. Zbl 0928.03001
Chaitin, Gregory J. |
|
1999
|
Information-theoretic computational complexity. Zbl 0282.68022
Chaitin, Gregory J. |
|
1974
|
Responses to “Theoretical mathematics: Toward a cultural synthesis of mathematics and theoretical physics”, by A. Jaffe and F. Quinn. Zbl 0803.01014
Atiyah, Michael; Borel, Armand; Chaitin, G. J.; Friedan, Daniel; Glimm, James; Gray, Jeremy J.; Hirsch, Morris W.; MacLane, Saunders; Mandelbrot, Benoit B.; Ruelle, David; Schwarz, Albert; Uhlenbeck, Karen; Thom, René; Witten, Edward; Zeeman, Christopher |
|
1994
|
On the simplicity and speed of programs for computing infinite sets of natural numbers. Zbl 0187.28401
Chaitin, G. J. |
|
1969
|
The limits of mathematics. Zbl 0955.68046
Chaitin, G. J. |
|
1998
|
Algorithmic entropy of sets. Zbl 0367.68036
Chaitin, Gregory J. |
|
1976
|
Exploring randomness. Zbl 0963.68084
Chaitin, Gregory J. |
|
2001
|
Information-theoretic incompleteness. Zbl 0776.68065
Chaitin, G. J. |
|
1992
|
Randomness and complexity in pure mathematics. Zbl 0877.68068
Chaitin, G. J. |
|
1994
|
A highly random number. Zbl 0982.68080
Becher, Verónica; Daicz, Sergio; Chaitin, Gregory |
|
2001
|
Meta math! The quest for omega. Zbl 1334.00001
Chaitin, Gregory J. |
|
2006
|
A note on Monte Carlo primality tests and algorithmic information theory. Zbl 0401.94008
Chaitin, Gregory J.; Schwartz, Jacob T. |
|
1978
|
Another example of higher order randomness. Zbl 1011.68042
Becher, Verónica; Chaitin, Gregory |
|
2002
|
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics. Zbl 1023.68589
Chaitin, G. J. |
|
1993
|
LISP program-size complexity. II. Zbl 0757.68066
Chaitin, G. J. |
|
1992
|
Algorithmic information theory: some recollections. Zbl 1138.03036
Chaitin, Gregory |
|
2007
|
The limits of mathematics. A course on information theory and the limits of formal reasoning. With a foreword by Cristian Calude. Zbl 0989.68055
Chaitin, Gregory J. |
|
1998
|
Information-theoretic incompleteness. Zbl 0782.68005
Chaitin, G. J. |
|
1993
|
Program-size complexity computes the halting problem. Zbl 1027.03512
Chaitin, G. J.; Arslanov, A.; Calude, C. |
|
1995
|
Program size, oracles, and the jump operation. Zbl 0359.94031
Chaitin, Gregory J. |
|
1977
|
LISP program-size complexity. Zbl 0776.68064
Chaitin, G. J. |
|
1992
|
The Berry paradox. Zbl 0890.68076
Chaitin, G. J. |
|
1995
|
An improvement on a theorem of E.F. Moore. Zbl 0173.01505
Chaitin, G. J. |
|
1965
|
Thoughts on the Riemann hypothesis. Zbl 1186.11050
Chaitin, G. J. |
|
2004
|
Proving Darwin. Making biology mathematical. Zbl 1335.92001
Chaitin, Gregory J. |
|
2013
|
Life as evolving software. Zbl 1257.92003
Chaitin, Gregory |
|
2013
|
What is a halting probability? Zbl 1184.68273
Calude, Cristian S.; Chaitin, G. J. |
|
2010
|
Gödel’s way. Exploits into an undecidable world. Zbl 1230.00014
Chaitin, Gregory; da Costa, Newton; Doria, Francisco Antonio |
|
2012
|
The halting probability Omega: irreducible complexity in pure mathematics. Zbl 1164.00002
Chaitin, Gregory |
|
2007
|
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics. Zbl 0825.68593
Chaitin, G. J. |
|
1995
|
Conversations with a mathematician. Math, art, science and the limits of reason. A collection of his most wide-ranging and non-technical lectures and interviews. Zbl 0980.01019
Chaitin, G. J. |
|
2002
|
The limits of mathematics. A course on information theory and limits of formal reasoning. Zbl 1024.68033
Chaitin, Gregory J. |
|
2003
|
Speculations on biology, information and complexity. Zbl 1169.68448
Chaitin, G. J. |
|
2007
|
The halting probability via Wang tiles. Zbl 1154.68058
Chaitin, Gregory |
|
2008
|
LISP program-size complexity. III. Zbl 0757.68067
Chaitin, G. J. |
|
1992
|
LISP program-size complexity. IV. Zbl 0757.68068
Chaitin, G. J. |
|
1992
|
A new version of algorithmic information theory. Zbl 1455.68074
Chaitin, G. J. |
|
1995
|
How much information can there be in a real number? Zbl 1152.03032
Chaitin, Gregory |
|
2007
|
The map and the territory. Exploring the foundations of science, thought and reality. With a foreword by Sir Roger Penrose and afterword by Dagfinn Føllesdal. Zbl 1388.00015
|
|
2018
|
A note on the number of \(N\)-bit strings with maximum complexity. Zbl 0791.68082
Chaitin, G. J. |
|
1993
|
Two philosophical applications of algorithmic information theory. Zbl 1038.68054
Chaitin, Gregory |
|
2003
|
How real are real numbers? Zbl 1113.03007
Chaitin, Gregory |
|
2006
|
Metaphysics, metamathematics and metabiology. Zbl 1244.68041
Chaitin, Gregory |
|
2011
|
An invitation to algorithmic information theory. Zbl 0914.68108
Chaitin, G. J. |
|
1997
|
Elegant Lisp programs. Zbl 0935.68007
Chaitin, Gregory J. |
|
1999
|
On the difficulty of computations. Zbl 0184.20501
Chaitin, G. J. |
|
1970
|
The map and the territory. Exploring the foundations of science, thought and reality. With a foreword by Sir Roger Penrose and afterword by Dagfinn Føllesdal. Zbl 1388.00015
|
|
2018
|
Proving Darwin. Making biology mathematical. Zbl 1335.92001
Chaitin, Gregory J. |
|
2013
|
Life as evolving software. Zbl 1257.92003
Chaitin, Gregory |
|
2013
|
Gödel’s way. Exploits into an undecidable world. Zbl 1230.00014
Chaitin, Gregory; da Costa, Newton; Doria, Francisco Antonio |
|
2012
|
Metaphysics, metamathematics and metabiology. Zbl 1244.68041
Chaitin, Gregory |
|
2011
|
What is a halting probability? Zbl 1184.68273
Calude, Cristian S.; Chaitin, G. J. |
|
2010
|
The halting probability via Wang tiles. Zbl 1154.68058
Chaitin, Gregory |
|
2008
|
Algorithmic information theory: some recollections. Zbl 1138.03036
Chaitin, Gregory |
|
2007
|
The halting probability Omega: irreducible complexity in pure mathematics. Zbl 1164.00002
Chaitin, Gregory |
|
2007
|
Speculations on biology, information and complexity. Zbl 1169.68448
Chaitin, G. J. |
|
2007
|
How much information can there be in a real number? Zbl 1152.03032
Chaitin, Gregory |
|
2007
|
Meta math! The quest for omega. Zbl 1334.00001
Chaitin, Gregory J. |
|
2006
|
How real are real numbers? Zbl 1113.03007
Chaitin, Gregory |
|
2006
|
Thoughts on the Riemann hypothesis. Zbl 1186.11050
Chaitin, G. J. |
|
2004
|
The limits of mathematics. A course on information theory and limits of formal reasoning. Zbl 1024.68033
Chaitin, Gregory J. |
|
2003
|
Two philosophical applications of algorithmic information theory. Zbl 1038.68054
Chaitin, Gregory |
|
2003
|
Another example of higher order randomness. Zbl 1011.68042
Becher, Verónica; Chaitin, Gregory |
|
2002
|
Conversations with a mathematician. Math, art, science and the limits of reason. A collection of his most wide-ranging and non-technical lectures and interviews. Zbl 0980.01019
Chaitin, G. J. |
|
2002
|
Exploring randomness. Zbl 0963.68084
Chaitin, Gregory J. |
|
2001
|
A highly random number. Zbl 0982.68080
Becher, Verónica; Daicz, Sergio; Chaitin, Gregory |
|
2001
|
The unknowable. Zbl 0928.03001
Chaitin, Gregory J. |
|
1999
|
Elegant Lisp programs. Zbl 0935.68007
Chaitin, Gregory J. |
|
1999
|
The limits of mathematics. Zbl 0955.68046
Chaitin, G. J. |
|
1998
|
The limits of mathematics. A course on information theory and the limits of formal reasoning. With a foreword by Cristian Calude. Zbl 0989.68055
Chaitin, Gregory J. |
|
1998
|
An invitation to algorithmic information theory. Zbl 0914.68108
Chaitin, G. J. |
|
1997
|
Program-size complexity computes the halting problem. Zbl 1027.03512
Chaitin, G. J.; Arslanov, A.; Calude, C. |
|
1995
|
The Berry paradox. Zbl 0890.68076
Chaitin, G. J. |
|
1995
|
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics. Zbl 0825.68593
Chaitin, G. J. |
|
1995
|
A new version of algorithmic information theory. Zbl 1455.68074
Chaitin, G. J. |
|
1995
|
Responses to “Theoretical mathematics: Toward a cultural synthesis of mathematics and theoretical physics”, by A. Jaffe and F. Quinn. Zbl 0803.01014
Atiyah, Michael; Borel, Armand; Chaitin, G. J.; Friedan, Daniel; Glimm, James; Gray, Jeremy J.; Hirsch, Morris W.; MacLane, Saunders; Mandelbrot, Benoit B.; Ruelle, David; Schwarz, Albert; Uhlenbeck, Karen; Thom, René; Witten, Edward; Zeeman, Christopher |
|
1994
|
Randomness and complexity in pure mathematics. Zbl 0877.68068
Chaitin, G. J. |
|
1994
|
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics. Zbl 1023.68589
Chaitin, G. J. |
|
1993
|
Information-theoretic incompleteness. Zbl 0782.68005
Chaitin, G. J. |
|
1993
|
A note on the number of \(N\)-bit strings with maximum complexity. Zbl 0791.68082
Chaitin, G. J. |
|
1993
|
Information-theoretic incompleteness. Zbl 0776.68065
Chaitin, G. J. |
|
1992
|
LISP program-size complexity. II. Zbl 0757.68066
Chaitin, G. J. |
|
1992
|
LISP program-size complexity. Zbl 0776.68064
Chaitin, G. J. |
|
1992
|
LISP program-size complexity. III. Zbl 0757.68067
Chaitin, G. J. |
|
1992
|
LISP program-size complexity. IV. Zbl 0757.68068
Chaitin, G. J. |
|
1992
|
Information, randomness and incompleteness. Papers on algorithmic information theory.
2nd ed. Zbl 1015.00502
Chaitin, G. J. |
|
1990
|
Algorithmic information theory. Zbl 0655.68003
Chaitin, Gregory J. |
|
1987
|
Information, randomness and incompleteness. Papers on algorithmic information theory. Zbl 1013.00525
Chaitin, G. J. |
|
1987
|
Incompleteness theorems for random reals. Zbl 0649.03046
Chaitin, G. J. |
|
1987
|
Gödel’s theorem and information. Zbl 1016.03501
Chaitin, Gregory J. |
|
1982
|
The maximum entropy formalism. A conference held at the Massachusetts Institute of Technology on May 2–4, 1978. Zbl 0467.94001
|
|
1979
|
A note on Monte Carlo primality tests and algorithmic information theory. Zbl 0401.94008
Chaitin, Gregory J.; Schwartz, Jacob T. |
|
1978
|
Algorithmic information theory. Zbl 0362.94035
Chaitin, G. J. |
|
1977
|
Program size, oracles, and the jump operation. Zbl 0359.94031
Chaitin, Gregory J. |
|
1977
|
Information-theoretic characterizations of recursive infinite strings. Zbl 0328.02029
Chaitin, Gregory J. |
|
1976
|
Algorithmic entropy of sets. Zbl 0367.68036
Chaitin, Gregory J. |
|
1976
|
A theory of program size formally identical to information theory. Zbl 0309.68045
Chaitin, Gregory J. |
|
1975
|
Information-theoretic limitations of formal systems. Zbl 0287.68027
Chaitin, Gregory J. |
|
1974
|
Information-theoretic computational complexity. Zbl 0282.68022
Chaitin, Gregory J. |
|
1974
|
On the difficulty of computations. Zbl 0184.20501
Chaitin, G. J. |
|
1970
|
On the length of programs for computing finite binary sequences: Statistical considerations. Zbl 0187.28303
Chaitin, G. J. |
|
1969
|
On the simplicity and speed of programs for computing infinite sets of natural numbers. Zbl 0187.28401
Chaitin, G. J. |
|
1969
|
On the length of programs for computing finite binary sequences. Zbl 0158.25301
Chaitin, Gregory J. |
|
1966
|
An improvement on a theorem of E.F. Moore. Zbl 0173.01505
Chaitin, G. J. |
|
1965
|