Gregory J. Chaitin

Publication Activity (10 Years)

Years Active: 1965-2021
Publications (10 Years): 1

Top Topics

Top Venues

Publications

Gregory J. Chaitin
A Visitor from Buenos Aires in the United States. Bull. EATCS 135 (2021)
Gregory J. Chaitin
How Much Information Can There Be in a Real Number? Computation, Physics and Beyond (2012)
Gregory J. Chaitin
Evolution of Mutating Software. Bull. EATCS 97 (2009)
Gregory J. Chaitin
The Halting Probability via Wang Tiles. Fundam. Informaticae 86 (4) (2008)
Gregory J. Chaitin
An Algebraic Characterization of the Halting Probability. Fundam. Informaticae 79 (1-2) (2007)
Gregory J. Chaitin
How Much Information Can There be in a Real Number? Int. J. Bifurc. Chaos 17 (6) (2007)
Gregory J. Chaitin
Speculations on Biology, Information and Complexity. Bull. EATCS 91 (2007)
Gregory J. Chaitin
Probability and Program-Size for Functions. Fundam. Informaticae 71 (4) (2006)
Gregory J. Chaitin
The Omega Number: Irreducible Complexity in Pure Math. MKM (2006)
Gregory J. Chaitin
How Real are Real Numbers? Int. J. Bifurc. Chaos 16 (6) (2006)
Gregory J. Chaitin
Algorithmic Irreducibility in a Cellular Automata Universe. J. Univers. Comput. Sci. 11 (12) (2005)
Gregory J. Chaitin
Two Philosophical Applications of Algorithmic Information Theory. DMTCS (2003)
Verónica Becher, Gregory J. Chaitin
Another Example of Higher Order Randomness. Fundam. Informaticae 51 (4) (2002)
Gregory J. Chaitin
Paradoxes of randomness and the limitations of mathematical reasoning. Complex. 7 (5) (2002)
Verónica Becher, Sergio Daicz, Gregory J. Chaitin
A Highly Random Number. DMTCS (2001)
Gregory J. Chaitin
A Century of Controvery Over the Foundations of Mathematics II CoRR (2000)
Gregory J. Chaitin
A century of controversy over the foundations of mathematics. Complex. 5 (5) (2000)
Gregory J. Chaitin
A new version of algorithmic information theory. Complex. 1 (4) (1996)
Gregory J. Chaitin
The Limits of Mathematics. J. Univers. Comput. Sci. 2 (5) (1996)
Gregory J. Chaitin
. Complex. 2 (1) (1996)
Gregory J. Chaitin
An Invitation to Algorithmic Information Theory. DMTCS (1996)
Gregory J. Chaitin
The Berry paradox. Complex. 1 (1) (1995)
Gregory J. Chaitin, Asat Arslanov, Cristian Calude
Program-size Complexity Computes the Halting Problem. Bull. EATCS 57 (1995)
Gregory J. Chaitin
The Limits of Mathematics - Course Outline and Software (Abstract). Analysis of Dynamical and Cognitive Systems (1993)
Gregory J. Chaitin
Register allocation and spilling via graph coloring (with retrospective) Best of PLDI (1982)
Gregory J. Chaitin
Register Allocation & Spilling via Graph Coloring. SIGPLAN Symposium on Compiler Construction (1982)
Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein
Register Allocation Via Coloring. Comput. Lang. 6 (1) (1981)
Gregory J. Chaitin
Algorithmic Information Theory. IBM J. Res. Dev. 21 (4) (1977)
Gregory J. Chaitin
Information-Theoretic Characterizations of Recursive Infinite Strings. Theor. Comput. Sci. 2 (1) (1976)
Gregory J. Chaitin
A Theory of Program Size Formally Identical to Information Theory. J. ACM 22 (3) (1975)
Gregory J. Chaitin
Information-theoretic computation complexity. IEEE Trans. Inf. Theory 20 (1) (1974)
Gregory J. Chaitin
Information-Theoretic Limitations of Formal Systems. J. ACM 21 (3) (1974)
Gregory J. Chaitin
Some philosophical implications of information-theoretic computational complexity. SIGACT News 5 (2) (1973)
Gregory J. Chaitin
On the difficulty of computations. IEEE Trans. Inf. Theory 16 (1) (1970)
Gregory J. Chaitin
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. J. ACM 16 (3) (1969)
Gregory J. Chaitin
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. J. ACM 16 (1) (1969)
Gregory J. Chaitin
On the Length of Programs for Computing Finite Binary Sequences. J. ACM 13 (4) (1966)
Gregory J. Chaitin
An Improvement on a Theorem of E. F. Moore. IEEE Trans. Electron. Comput. 14 (3) (1965)