• Publications
  • Influence
A Theory of Program Size Formally Identical to Information Theory
  • G. Chaitin
  • Mathematics, Computer Science
  • JACM
  • 1 July 1975
TLDR
A new definition of program-size complexity is made, which has precisely the formal properties of the entropy concept of information theory. Expand
On the Length of Programs for Computing Finite Binary Sequences
  • G. Chaitin
  • Mathematics, Computer Science
  • JACM
  • 1 October 1966
TLDR
An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences. Expand
Algorithmic information theory
  • G. Chaitin
  • Computer Science
  • Cambridge tracts in theoretical computer science
  • 15 August 2006
A methodology for the real world
TLDR
Preliminary results of an experimental implementation in a PL/I optimizing compiler suggest that global register allocation approaching that of hand-coded assembly language may be attainable. Expand
Register Allocation Via Coloring
TLDR
The Register Allocation Phase of an experimental PL/I compiler for the IBM System/370 is described, which suggests that global register allocation approaching that of hand-coded assembly language may be attainable. Expand
Register allocation & spilling via graph coloring
TLDR
This work has discovered how to extend the graph coloring approach so that it naturally solves the spilling problem, and produces better object code and takes much less compile time. Expand
Register allocation and spilling via graph coloring
TLDR
This work has discovered how to extend the graph coloring approach so that it naturally solves the spilling problem, and produces better object code and takes much less compile time. Expand
Algorithmic Information Theory
  • G. Chaitin
  • Computer Science
  • IBM J. Res. Dev.
  • 30 October 1987
This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, forExpand
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
TLDR
An attempt is made to carry out a program for defining the concept of a random or patternless, finite binary sequence, and for subsequently defining arandom or patterned, infinite binary sequence to be a sequence whose initial segments are all random orpatternless finite binary sequences. Expand
Information-Theoretic Characterizations of Recursive Infinite Strings
  • G. Chaitin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1 June 1976
TLDR
Loveland's method shows that this is no longer a sufficient condition for x to be recursive if one merely stipulates that K ( x n ) ⩽ K ( n ) + c for infinitely many n. Expand
...
1
2
3
4
5
...