Gregory J. Chaitin

According to our database, Gregory J. Chaitin authored at least 44 papers between 1965 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

A Visitor from Buenos Aires in the United States.

Gregory J. Chaitin

Bull. EATCS, 2021

2009

Evolution of Mutating Software.

Gregory J. Chaitin

Bull. EATCS, 2009

2008

The Halting Probability via Wang Tiles.

Gregory J. Chaitin

Fundam. Informaticae, 2008

2007

How Much Information Can There be in a Real Number?

Gregory J. Chaitin

Int. J. Bifurc. Chaos, 2007

An Algebraic Characterization of the Halting Probability.

Gregory J. Chaitin

Fundam. Informaticae, 2007

Speculations on Biology, Information and Complexity.

Gregory J. Chaitin

Bull. EATCS, 2007

Thinking about Gödel and Turing - Essays on Complexity, 1970 - 2007.

Gregory J. Chaitin

World Scientific, ISBN: 978-981-270-895-3, 2007

2006

How Real are Real Numbers?

Gregory J. Chaitin

Int. J. Bifurc. Chaos, 2006

Probability and Program-Size for Functions.

Gregory J. Chaitin

Fundam. Informaticae, 2006

The Omega Number: Irreducible Complexity in Pure Math.

Gregory J. Chaitin

Proceedings of the Mathematical Knowledge Management, 5th International Conference, 2006

2005

Algorithmic Irreducibility in a Cellular Automata Universe.

Gregory J. Chaitin

J. Univers. Comput. Sci., 2005

2003

Two Philosophical Applications of Algorithmic Information Theory.

Gregory J. Chaitin

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

Another Example of Higher Order Randomness.

Verónica Becher, Gregory J. Chaitin

Fundam. Informaticae, 2002

Paradoxes of randomness and the limitations of mathematical reasoning.

Gregory J. Chaitin

Complex., 2002

Conversations with a mathematician - math, art, science and the limits of reason.

Gregory J. Chaitin

Springer, ISBN: 978-1-85233-549-6, 2002

Exploring RANDOMNESS.

Gregory J. Chaitin

Discrete mathematics and theoretical computer science, Springer, ISBN: 978-1-85233-417-8, 2002

2001

A Highly Random Number.

Verónica Becher, Sergio Daicz, Gregory J. Chaitin

Proceedings of the Combinatorics, 2001

2000

A Century of Controvery Over the Foundations of Mathematics II

Gregory J. Chaitin

CoRR, 2000

A century of controversy over the foundations of mathematics.

Gregory J. Chaitin

Complex., 2000

A Century of Controversy over the Foundations of Mathematics.

Gregory J. Chaitin

Proceedings of the Finite Versus Infinite, 2000

1996

The Limits of Mathematics.

Gregory J. Chaitin

J. Univers. Comput. Sci., 1996

How to run algorithmic information theory on a computer: <i>Studying the limits of mathematical reasoning</i>.

Gregory J. Chaitin

Complex., 1996

A new version of algorithmic information theory.

Gregory J. Chaitin

Complex., 1996

An Invitation to Algorithmic Information Theory.

Gregory J. Chaitin

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Program-size Complexity Computes the Halting Problem.

Gregory J. Chaitin, Asat Arslanov, Cristian Calude

Bull. EATCS, 1995

The Berry paradox.

Gregory J. Chaitin

Complex., 1995

1993

The Limits of Mathematics - Course Outline and Software (Abstract).

Gregory J. Chaitin

Proceedings of the Analysis of Dynamical and Cognitive Systems, 1993

1992

Information-Theoretic Incompleteness

Gregory J. Chaitin

World Scientific Series in Computer Science 35, World Scientific, ISBN: 978-981-4505-10-9, 1992

1990

Information, Randomness and Incompleteness - Papers on Algorithmic Information Theory; 2^nd Edition

Gregory J. Chaitin

World Scientific Series in Computer Science 8, World Scientific, ISBN: 978-981-02-0171-5, 1990

1987

Algorithmic information theory.

Gregory J. Chaitin

Cambridge tracts in theoretical computer science 1, Cambridge University Press, ISBN: 978-0-521-34306-0, 1987

1982

Register Allocation & Spilling via Graph Coloring.

Gregory J. Chaitin

Proceedings of the SIGPLAN '82 Symposium on Compiler Construction, 1982

Register allocation and spilling via graph coloring (with retrospective)

Gregory J. Chaitin

Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1982

1981

Register Allocation Via Coloring.

Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein

Comput. Lang., 1981

1977

Algorithmic Information Theory.

Gregory J. Chaitin

IBM J. Res. Dev., 1977

1976

Information-Theoretic Characterizations of Recursive Infinite Strings.

Gregory J. Chaitin

Theor. Comput. Sci., 1976

1975

A Theory of Program Size Formally Identical to Information Theory.

Gregory J. Chaitin

J. ACM, 1975

1974

Information-theoretic computation complexity.

Gregory J. Chaitin

IEEE Trans. Inf. Theory, 1974

Information-Theoretic Limitations of Formal Systems.

Gregory J. Chaitin

J. ACM, 1974

1973

Some philosophical implications of information-theoretic computational complexity.

Gregory J. Chaitin

SIGACT News, 1973

1970

On the difficulty of computations.

Gregory J. Chaitin

IEEE Trans. Inf. Theory, 1970

1969

On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers.

Gregory J. Chaitin

J. ACM, 1969

On the Length of Programs for Computing Finite Binary Sequences: statistical considerations.

Gregory J. Chaitin

J. ACM, 1969

1966

On the Length of Programs for Computing Finite Binary Sequences.

Gregory J. Chaitin

J. ACM, 1966

1965

An Improvement on a Theorem of E. F. Moore.

Gregory J. Chaitin

IEEE Trans. Electron. Comput., 1965