Gregory J. Chaitin

45 papers Journal 30Unranked 8
YearRankTypeTitle / Venue / Authors
2021 J jnl
A Visitor from Buenos Aires in the United States.
Bull. EATCS
Gregory J. Chaitin
2012 — conf
How Much Information Can There Be in a Real Number?
Computation, Physics and Beyond
Gregory J. Chaitin
2009 J jnl
Evolution of Mutating Software.
Bull. EATCS
Gregory J. Chaitin
2008 J jnl
The Halting Probability via Wang Tiles.
Fundam. Informaticae
Gregory J. Chaitin
2007 J jnl
An Algebraic Characterization of the Halting Probability.
Fundam. Informaticae
Gregory J. Chaitin
2007 J jnl
How Much Information Can There be in a Real Number?
Int. J. Bifurc. Chaos
Gregory J. Chaitin
2007 J jnl
Speculations on Biology, Information and Complexity.
Bull. EATCS
Gregory J. Chaitin
2007 — book
Thinking about Gödel and Turing - Essays on Complexity, 1970 - 2007.
Gregory J. Chaitin
2006 J jnl
How Real are Real Numbers?
Int. J. Bifurc. Chaos
Gregory J. Chaitin
2006 J jnl
Probability and Program-Size for Functions.
Fundam. Informaticae
Gregory J. Chaitin
2006 — conf
The Omega Number: Irreducible Complexity in Pure Math.
MKM
Gregory J. Chaitin
2005 J jnl
Algorithmic Irreducibility in a Cellular Automata Universe.
J. Univers. Comput. Sci.
Gregory J. Chaitin
2003 — conf
Two Philosophical Applications of Algorithmic Information Theory.
DMTCS
Gregory J. Chaitin
2002 J jnl
Another Example of Higher Order Randomness.
Fundam. Informaticae
Verónica Becher, Gregory J. Chaitin
2002 — book
Conversations with a mathematician - math, art, science and the limits of reason.
Gregory J. Chaitin
2002 — book
Exploring RANDOMNESS.
Gregory J. Chaitin
2002 J jnl
Paradoxes of randomness and the limitations of mathematical reasoning.
Complex.
Gregory J. Chaitin
2001 — conf
A Highly Random Number.
DMTCS
Verónica Becher, Sergio Daicz, Gregory J. Chaitin
2000 — ch.
A Century of Controversy over the Foundations of Mathematics.
Finite Versus Infinite
Gregory J. Chaitin
2000 J jnl
A Century of Controvery Over the Foundations of Mathematics II
CoRR
Gregory J. Chaitin
2000 J jnl
A century of controversy over the foundations of mathematics.
Complex.
Gregory J. Chaitin
1996 J jnl
A new version of algorithmic information theory.
Complex.
Gregory J. Chaitin
1996 — conf
An Invitation to Algorithmic Information Theory.
DMTCS
Gregory J. Chaitin
1996 J jnl
How to run algorithmic information theory on a computer:
Complex.
Gregory J. Chaitin
1996 J jnl
The Limits of Mathematics.
J. Univers. Comput. Sci.
Gregory J. Chaitin
1995 J jnl
Program-size Complexity Computes the Halting Problem.
Bull. EATCS
Gregory J. Chaitin, Asat Arslanov, Cristian Calude
1995 J jnl
The Berry paradox.
Complex.
Gregory J. Chaitin
1993 — conf
The Limits of Mathematics - Course Outline and Software (Abstract).
Analysis of Dynamical and Cognitive Systems
Gregory J. Chaitin
1992 — book
Information-Theoretic Incompleteness
Gregory J. Chaitin
1990 — book
Information, Randomness and Incompleteness - Papers on Algorithmic Information Theory; 2
Gregory J. Chaitin
1987 — book
Algorithmic information theory.
Gregory J. Chaitin
1982 — conf
Register Allocation & Spilling via Graph Coloring.
SIGPLAN Symposium on Compiler Construction
Gregory J. Chaitin
1982 — conf
Register allocation and spilling via graph coloring (with retrospective)
Best of PLDI
Gregory J. Chaitin
1981 J jnl
Register Allocation Via Coloring.
Comput. Lang.
Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein
1977 J jnl
Algorithmic Information Theory.
IBM J. Res. Dev.
Gregory J. Chaitin
1976 J jnl
Information-Theoretic Characterizations of Recursive Infinite Strings.
Theor. Comput. Sci.
Gregory J. Chaitin
1975 J jnl
A Theory of Program Size Formally Identical to Information Theory.
J. ACM
Gregory J. Chaitin
1974 J jnl
Information-Theoretic Limitations of Formal Systems.
J. ACM
Gregory J. Chaitin
1974 J jnl
Information-theoretic computation complexity.
IEEE Trans. Inf. Theory
Gregory J. Chaitin
1973 J jnl
Some philosophical implications of information-theoretic computational complexity.
SIGACT News
Gregory J. Chaitin
1970 J jnl
On the difficulty of computations.
IEEE Trans. Inf. Theory
Gregory J. Chaitin
1969 J jnl
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations.
J. ACM
Gregory J. Chaitin
1969 J jnl
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers.
J. ACM
Gregory J. Chaitin
1966 J jnl
On the Length of Programs for Computing Finite Binary Sequences.
J. ACM
Gregory J. Chaitin
1965 J jnl
An Improvement on a Theorem of E. F. Moore.
IEEE Trans. Electron. Comput.
Gregory J. Chaitin