Gregory J. Chaitin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2021

A Visitor from Buenos Aires in the United StatesGregory J. Chaitin. eatcs, 135, 2021. [doi]

2012

How Much Information Can There Be in a Real Number?Gregory J. Chaitin. BIRTHDAY 2012: 247-251 [doi]

2009

Evolution of Mutating SoftwareGregory J. Chaitin. eatcs, 97:157-164, 2009.

2008

The Halting Probability via Wang TilesGregory J. Chaitin. FUIN, 86(4):429-433, 2008. [doi]

2007

An Algebraic Characterization of the Halting ProbabilityGregory J. Chaitin. FUIN, 79(1-2):17-23, 2007. [doi]

How Much Information Can There be in a Real Number?Gregory J. Chaitin. IJBC, 17(6):1933-1935, 2007. [doi]

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

Speculations on Biology, Information and ComplexityGregory J. Chaitin. eatcs, 91:231-237, 2007.

2006

Probability and Program-Size for FunctionsGregory J. Chaitin. FUIN, 71(4):367-370, 2006. [doi]

The Omega Number: Irreducible Complexity in Pure MathGregory J. Chaitin. AISC 2006: 1 [doi]

How Real are Real Numbers?Gregory J. Chaitin. IJBC, 16(6):1841-1848, 2006. [doi]

2005

Algorithmic Irreducibility in a Cellular Automata UniverseGregory J. Chaitin. jucs, 11(12):1901-1903, 2005. [doi]

2003

Two Philosophical Applications of Algorithmic Information TheoryGregory J. Chaitin. dmtcs 2003: 1-10 [doi]

2002

Another Example of Higher Order RandomnessVerónica Becher, Gregory J. Chaitin. FUIN, 51(4):325-338, 2002. [doi]

Conversations with a mathematician - math, art, science and the limits of reasonGregory J. Chaitin. Springer, 2002. [doi]

Paradoxes of randomness and the limitations of mathematical reasoningGregory J. Chaitin. complexity, 7(5):14-21, 2002. [doi]

Exploring RANDOMNESSGregory J. Chaitin. Discrete mathematics and theoretical computer science, Springer, 2002.

2001

A Highly Random NumberVerónica Becher, Sergio Daicz, Gregory J. Chaitin. dmtcs 2001: 55-68 [doi]

2000

A century of controversy over the foundations of mathematicsGregory J. Chaitin. complexity, 5(5):12-21, 2000. [doi]

A Century of Controversy over the Foundations of MathematicsGregory J. Chaitin. In Cristian Calude, Gheorghe Paun, editors, Finite Versus Infinite. Discrete mathematics and theoretical computer science, pages 75-100, Springer, 2000. [doi]

1996

The Limits of MathematicsGregory J. Chaitin. jucs, 2(5):270-305, 1996.

A new version of algorithmic information theoryGregory J. Chaitin. complexity, 1(4):55-59, 1996. [doi]

Studying the limits of mathematical reasoningGregory J. Chaitin. complexity, 2(1):15-21, 1996. [doi]

An Invitation to Algorithmic Information TheoryGregory J. Chaitin. dmtcs 1996: 1-23

1995

Program-size Complexity Computes the Halting ProblemGregory J. Chaitin, Asat Arslanov, Cristian Calude. eatcs, 57, 1995.

The Berry paradoxGregory J. Chaitin. complexity, 1(1):26-30, 1995. [doi]

1993

The Limits of Mathematics - Course Outline and Software (Abstract)Gregory J. Chaitin. ac 1995: 1

1992

Information-Theoretic IncompletenessGregory J. Chaitin. Volume 35 of World Scientific Series in Computer Science, World Scientific, 1992. [doi]

1990

nd EditionGregory J. Chaitin. Volume 8 of World Scientific Series in Computer Science, World Scientific, 1990. [doi]

1987

Algorithmic information theoryGregory J. Chaitin. Volume 1 of Cambridge tracts in theoretical computer science, Cambridge University Press, 1987.

1982

Register Allocation & Spilling via Graph ColoringGregory J. Chaitin. sigplan 1982: 98-105 [doi]

Register allocation and spilling via graph coloring (with retrospective)Gregory J. Chaitin. PLDI 2004: 66-74 [doi]

1981

Register Allocation Via ColoringGregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein. Comp. Lang., Syst. \& Struct., 6(1):47-57, 1981.

1977

Algorithmic Information TheoryGregory J. Chaitin. ibmrd, 21(4):350-359, 1977.

1976

Information-Theoretic Characterizations of Recursive Infinite StringsGregory J. Chaitin. TCS, 2(1):45-48, 1976.

1975

A Theory of Program Size Formally Identical to Information TheoryGregory J. Chaitin. JACM, 22(3):329-340, 1975. [doi]

1974

Information-Theoretic Limitations of Formal SystemsGregory J. Chaitin. JACM, 21(3):403-424, 1974. [doi]

Information-theoretic computation complexityGregory J. Chaitin. TIT, 20(1):10-15, 1974. [doi]

1973

Some philosophical implications of information-theoretic computational complexityGregory J. Chaitin. sigact, 5(2):21-23, 1973. [doi]

1970

On the difficulty of computationsGregory J. Chaitin. TIT, 16(1):5-9, 1970. [doi]

1969

On the Length of Programs for Computing Finite Binary Sequences: statistical considerationsGregory J. Chaitin. JACM, 16(1):145-159, 1969. [doi]

On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural NumbersGregory J. Chaitin. JACM, 16(3):407-422, 1969. [doi]

1966

On the Length of Programs for Computing Finite Binary SequencesGregory J. Chaitin. JACM, 13(4):547-569, 1966. [doi]

1965

An Improvement on a Theorem of E. F. MooreGregory J. Chaitin. TC, 14(3):466-467, 1965. [doi]

Sign in or sign up to see more results.

runs on WebDSL