An Improvement on a Theorem of E. F. Moore. - Gregory J. Chaitin (IEEE Trans. Electron. Comput., 1965)

On the Length of Programs for Computing Finite Binary Sequences. - Gregory J. Chaitin (J. ACM, 1966)

On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. - Gregory J. Chaitin (J. ACM, 1969)

On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. - Gregory J. Chaitin (J. ACM, 1969)

On the difficulty of computations. - Gregory J. Chaitin (IEEE Trans. Inf. Theory, 1970)

Some philosophical implications of information-theoretic computational complexity. - Gregory J. Chaitin (SIGACT News, 1973)

Information-Theoretic Limitations of Formal Systems. - Gregory J. Chaitin (J. ACM, 1974)

Information-theoretic computation complexity. - Gregory J. Chaitin (IEEE Trans. Inf. Theory, 1974)

A Theory of Program Size Formally Identical to Information Theory. - Gregory J. Chaitin (J. ACM, 1975)

Information-Theoretic Characterizations of Recursive Infinite Strings. - Gregory J. Chaitin (Theor. Comput. Sci., 1976)

Algorithmic Information Theory. - Gregory J. Chaitin (IBM J. Res. Dev., 1977)

Register Allocation Via Coloring. - Gregory J. Chaitin; Marc A. Auslander; Ashok K. Chandra; John Cocke; Martin E. Hopkins; Peter W. Markstein (Comput. Lang., 1981)

Register allocation and spilling via graph coloring (with retrospective) - Gregory J. Chaitin (Best of PLDI, 1982)

Register Allocation & Spilling via Graph Coloring. - Gregory J. Chaitin (SIGPLAN Symposium on Compiler Construction, 1982)

Algorithmic information theory. - Gregory J. Chaitin (Cambridge University Press, 1987)

Information, Randomness and Incompleteness - Papers on Algorithmic Information Theory; 2nd Edition - Gregory J. Chaitin (World Scientific, 1990)

Information-Theoretic Incompleteness - Gregory J. Chaitin (World Scientific, 1992)

The Limits of Mathematics - Course Outline and Software (Abstract). - Gregory J. Chaitin (Analysis of Dynamical and Cognitive Systems, 1993)

The Berry paradox. - Gregory J. Chaitin (Complex., 1995)

Program-size Complexity Computes the Halting Problem. - Gregory J. Chaitin; Asat Arslanov; Cristian Calude (Bull. EATCS, 1995)

An Invitation to Algorithmic Information Theory. - Gregory J. Chaitin (DMTCS, 1996)

A new version of algorithmic information theory. - Gregory J. Chaitin (Complex., 1996)

How to run algorithmic information theory on a computer: Studying the limits of mathematical reasoning. - Gregory J. Chaitin (Complex., 1996)

The Limits of Mathematics. - Gregory J. Chaitin (J. Univers. Comput. Sci., 1996)

A Century of Controversy over the Foundations of Mathematics. - Gregory J. Chaitin (Finite Versus Infinite, 2000)

A century of controversy over the foundations of mathematics. - Gregory J. Chaitin (Complex., 2000)

A Century of Controvery Over the Foundations of Mathematics II - Gregory J. Chaitin (CoRR, 2000)

A Highly Random Number. - Verónica Becher; Sergio Daicz; Gregory J. Chaitin (DMTCS, 2001)

Exploring RANDOMNESS. - Gregory J. Chaitin (Springer, 2002)

Conversations with a mathematician - math, art, science and the limits of reason. - Gregory J. Chaitin (Springer, 2002)

Paradoxes of randomness and the limitations of mathematical reasoning. - Gregory J. Chaitin (Complex., 2002)

Another Example of Higher Order Randomness. - Verónica Becher; Gregory J. Chaitin (Fundam. Informaticae, 2002)

Two Philosophical Applications of Algorithmic Information Theory. - Gregory J. Chaitin (DMTCS, 2003)

Algorithmic Irreducibility in a Cellular Automata Universe. - Gregory J. Chaitin (J. Univers. Comput. Sci., 2005)

The Omega Number: Irreducible Complexity in Pure Math. - Gregory J. Chaitin (MKM, 2006)

Probability and Program-Size for Functions. - Gregory J. Chaitin (Fundam. Informaticae, 2006)

How Real are Real Numbers? - Gregory J. Chaitin (Int. J. Bifurc. Chaos, 2006)

Thinking about Gödel and Turing - Essays on Complexity, 1970 - 2007. - Gregory J. Chaitin (World Scientific, 2007)

Speculations on Biology, Information and Complexity. - Gregory J. Chaitin (Bull. EATCS, 2007)

An Algebraic Characterization of the Halting Probability. - Gregory J. Chaitin (Fundam. Informaticae, 2007)

How Much Information Can There be in a Real Number? - Gregory J. Chaitin (Int. J. Bifurc. Chaos, 2007)

The Halting Probability via Wang Tiles. - Gregory J. Chaitin (Fundam. Informaticae, 2008)

Evolution of Mutating Software. - Gregory J. Chaitin (Bull. EATCS, 2009)

A Visitor from Buenos Aires in the United States. - Gregory J. Chaitin (Bull. EATCS, 2021)