How to run algorithmic information theory on a computer: Studying the limits of mathematical reasoning
- Gregory J. Chaitin
- 1996
- Complexity
Publications
Date
Featured collections
Popular topics
33 results for Gregory J. Chaitin
Randomness in arithmetic and the decline and fall of reductionism in pure mathematics
- G.J. Chaitin
- 1995
- Chaos, Solitons and Fractals
A note on the number of N-bit strings with maximum complexity
- G.J. Chaitin
- 1993
- Applied Mathematics and Computation
LISP program-size complexity
- G.J. Chaitin
- 1992
- Applied Mathematics and Computation
Information-theoretic incompleteness
- G.J. Chaitin
- 1992
- Applied Mathematics and Computation
LISP program-size complexity IV
- G.J. Chaitin
- 1992
- Applied Mathematics and Computation
LISP program-size complexity II
- G.J. Chaitin
- 1992
- Applied Mathematics and Computation
Incompleteness theorems for random reals
- G.J Chaitin
- 1987
- Advances in Applied Mathematics
Gödel's theorem and information
- Gregory J. Chaitin
- 1982
- International Journal of Theoretical Physics
Register allocation via coloring
- Gregory J. Chaitin
- Marc A. Auslander
- et al.
- 1981
- Computer Languages