Randomness and generalizations of fixed point free functions
暂无分享,去创建一个
[1] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[2] Carl G. Jockusch,et al. Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers , 1984, Journal of Symbolic Logic.
[3] R. Soare,et al. Π⁰₁ classes and degrees of theories , 1972 .
[4] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..
[5] Antonín Kučera. On the use of Diagonally Nonrecursive Functions , 1989 .
[6] Antonín Kucera,et al. An Alternative, Priority-Free, Solution to Post's Problem , 1996, MFCS.
[7] Robert I. Soare,et al. Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion , 1989, J. Symb. Log..
[8] Robert I. Soare,et al. Degrees of members of Π10 classes , 1972 .
[9] Robert I. Soare,et al. Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.
[10] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..