78

Lowness Properties and Randomness
– André Nies

332

The definition of random sequences
– P MartinLöf
 1966

329

A Theory of Program Size Formally Identical to Information Theory
– Gregory J. Chaitin
 1975

53

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

59

InformationTheoretic Characterizations of Recursive Infinite Strings
– Gregory J. Chaitin
 1976

1678

An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition
– Ming Li, Paul Vitanyi
 1997

472

Recursively Enumerable Sets and Degrees
– R Soare
 1987

34

Using random sets as oracles
– Denis R. Hirschfeldt, Frank Stephan, André Nies

28

Reals which Compute Little
– A. Nies, André Nies
 2002

107

On the notion of a random sequence
– Leonid A Levin
 1973

93

Computability and Randomness
– André Nies

66

Randomness and Recursive Enumerability
– Theodore A. Slaman

149

Zufälligkeit und Wahrscheinlichkeit
– C P Schnorr
 1971

26

Computational Randomness and Lowness
– Sebastiaan A. Terwijn, Domenico Zambella, Every Set U
 2001

59

Random Sequences
– Michiel van Lambalgen

59

Calibrating randomness
– Rod Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan, A. Terwijn

36

Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees
– K AmbosSpies, C G Jockusch, R Shore, R I

155

Algorithmic randomness and complexity
– R G Downey, D R Hirschfeldt
 2010

30

Randomness and Complexity
– Y Wang
