Lowness Properties of Reals and Randomness

[1]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[2]  Claus-Peter Schnorr,et al.  Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie , 1971, Lecture Notes in Mathematics.

[3]  G. Chaitin.  A Theory of Program Size Formally Identical to Information Theory , 1975, JACM.

[4]  Gregory J. Chaitin.  Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..

[5]  W. Fitch.  Random sequences. , 1983, Journal of molecular biology.

[6]  Robert I. Soare,et al.  An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees , 1984 .

[7]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[8]  Theodore A. Slaman,et al.  When oracles do not help , 1991, COLT '91.

[9]  Antonín Kučera,et al.  On Relative Randomness , 1993, Ann. Pure Appl. Log..

[10]  Cristian S. Calude.  Information and Randomness , 1994, Monographs in Theoretical Computer Science An EATCS Series.

[11]  Sebastiaan Terwijn,et al.  Lowness for The Class of Random Sets , 1999, J. Symb. Log..

[12]  Klaus Ambos-Spies,et al.  Randomness in Computability Theory , 2000 .

[13]  Marcia J. Groszek,et al.  An almost deep degree , 2001, Journal of Symbolic Logic.

[14]  Sebastiaan Terwijn,et al.  Computational randomness and lowness* , 2001, Journal of Symbolic Logic.

[15]  Theodore A. Slaman.  Aspects of the Turing Jump , 2002 .

[16]  André Nies,et al.  Reals which Compute Little , 2002 .

[17]  André Nies,et al.  Trivial Reals , 2002, CCA.