On Relative Randomness
暂无分享,去创建一个
[1] Robert I. Soare,et al. Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion , 1989, J. Symb. Log..
[2] Ming Li,et al. Kolmogorov Complexity and its Applications , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[3] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..
[4] R. Soare,et al. Π⁰₁ classes and degrees of theories , 1972 .
[5] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[6] Antonín Kučera,et al. Randomness and generalizations of fixed point free functions , 1990 .
[7] Antonín Kucera,et al. An Alternative, Priority-Free, Solution to Post's Problem , 1996, MFCS.
[8] A. Kucera. Measure, Π10-classes and complete extensions of PA , 1985 .
[9] A. Kolmogorov,et al. ALGORITHMS AND RANDOMNESS , 1988 .
[10] R. Soare. Recursively enumerable sets and degrees , 1987 .
[11] Michiel van Lambalgen,et al. The Axiomatization of Randomness , 1990, J. Symb. Log..
[12] Antonín Kučera. On the use of Diagonally Nonrecursive Functions , 1989 .
[13] Steven M. Kautz. Degrees of random sets , 1991 .