1. A criterion for the completeness of recursively enumerable sets, and some generalizations of a fixed point theorem;Arslanov, M. M.;Izv. Vys\v{s}. U\v{c}ebn. Zaved. Matematika,1977
2. Π⁰₁ classes in computability theory;Cenzer, Douglas,1999
3. R. Downey and D. Hirschfeldt, Algorithmic randomness and complexity, Springer-Verlag, Berlin, to appear.
4. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, and Sebastiaan A. Terwijn, Calibrating randomness, Bulletin of Symbolic Logic, to appear.
5. A criterion for completeness of degrees of unsolvability;Friedberg, Richard;J. Symbolic Logic,1957