|
49
|
Trivial Reals
– Rod G. Downey, et al.
|
|
68
|
Computability and Randomness
– André Nies
|
|
32
|
Using random sets as oracles
– Denis R. Hirschfeldt, Frank Stephan, André Nies
|
|
123
|
Algorithmic randomness and complexity
– R Downey, D Hirschfeldt
- 2010
|
|
294
|
The definition of random sequences
– P Martin-Löf
|
|
411
|
Recursively Enumerable Sets and Degrees
– Robert I Soare
- 1987
|
|
26
|
Reals which Compute Little
– A. Nies, André Nies
- 2002
|
|
54
|
Draft of a paper (or series of papers) on Chaitin’s work. Unpublished notes
– R Solovay
- 1975
|
|
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
|
|
15
|
and André Nies. Randomness and computability: open questions
– Joseph S Miller
|
|
44
|
Π0 1-classes and complete extensions of PA
– Measure
- 1984
|
|
18
|
Low for random reals and positive-measure domination
– Bjørn Kjos-hanssen, Communicated Julia Knight
- 2005
|
|
25
|
Almost everywhere domination
– Natasha L. Dobrinen, Stephen G. Simpson
|
|
33
|
Kolmogorov complexity and the Recursion Theorem. Manuscript, submitted for publication
– Bjørn Kjos-hanssen, Wolfgang Merkle, Frank Stephan
- 2005
|
|
103
|
Π 0 1 classes and degrees of theories
– Robert I Soare
- 1972
|
|
133
|
Zufälligkeit und Wahrscheinlichkeit
– C Schnorr
- 1971
|
|
58
|
Randomness and Recursive Enumerability
– Theodore A. Slaman
|
|
11
|
Almost everywhere domination and superhighness
– Stephen G. Simpson
- 2007
|
