|
294
|
The definition of random sequences
– P Martin-Löf
|
|
67
|
Lowness Properties and Randomness
– André Nies
|
|
274
|
A Theory of Program Size Formally Identical to Information Theory
– Gregory J. Chaitin
- 1975
|
|
1412
|
An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
– Ming Li, Paul Vitanyi
- 1997
|
|
54
|
Draft of a paper (or series of papers) on Chaitin’s work. Unpublished notes
– R Solovay
- 1975
|
|
411
|
Recursively Enumerable Sets and Degrees
– Robert I Soare
- 1987
|
|
55
|
Information-Theoretic Characterizations of Recursive Infinite Strings
– Gregory J. Chaitin
- 1976
|
|
32
|
Using random sets as oracles
– Denis R. Hirschfeldt, Frank Stephan, André Nies
|
|
26
|
Reals which Compute Little
– A. Nies, André Nies
- 2002
|
|
91
|
On the notion of a random sequence
– L A Levin
- 1973
|
|
50
|
Calibrating randomness
– Rod Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan, A. Terwijn
|
|
58
|
Randomness and Recursive Enumerability
– Theodore A. Slaman
|
|
133
|
Zufälligkeit und Wahrscheinlichkeit
– C Schnorr
- 1971
|
|
68
|
Computability and Randomness
– André Nies
|
|
24
|
Computational Randomness and Lowness
– Sebastiaan A. Terwijn, Domenico Zambella, Every Set U
- 2001
|
|
32
|
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
– K Ambos-Spies, Carl G Jockusch, Richard A Shore, Robert I Soare
- 1984
|
|
123
|
Algorithmic randomness and complexity
– R Downey, D Hirschfeldt
- 2010
|
|
14
|
Lambalgen, Random sequences
– M van
- 1987
|
|
55
|
Random Sequences
– Michiel van Lambalgen
|