331

A Theory of Program Size Formally Identical to Information Theory
–
 1975

66

Randomness and Recursive Enumerability
–

321

Algorithmic information theory
–
 1977

333

The definition of random sequences
–
 1966

1690

An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
–
 1997

161

Algorithmic Randomness and Complexity
–
 2010

477

Recursively enumerable sets and degrees
–
 1987

53

of a paper (or series of papers) on Chaitin’s work ... done for the most part during the period of Sept
–
 1974

32

Incompleteness Theorems for Random Reals
–
 1987

13

DegreeTheoretic Aspects of Computably Enumerable Reals
–
 1998

107

On the notion of a random sequence
–
 1973

95

Laws of information conservation (nongrowth) and aspects of the foundation of probability theory
–
 1974

9

Algorithmic information theory and fractal sets
–

34

A generalization of Chaitin’s halting probability Ω and halting selfsimilar sets
–
 2002

6

Incompleteness theorems for random reals,” Adv
–
 1987

90

On the symmetry of algorithmic information
–
 1974

96

Computability and Randomness
–

30

Recursion theory and Dedekind cuts
–
 1969

48

On partial randomness
–
 2006
