1. An extension of the nondiamond thoerem in classical and α-recursion theory;Ambos-Spies;Journal of Symbolic Logic,1984
2. P. Cholak, R. Downey, N. Greenberg, Strong jump-traceability 1 : The computably enumerable case, Advances in Mathematics (in press)
3. R. Downey, The sixth lecture on algorithmic randomness, in: Proceedings of the IMS Workshop on Computational Aspects of Infinity, Singapore, 2007 (in press)
4. Every low boolean algebra is isomorphic to a recursive one;Downey;Proceedings of the American Mathematical Society,1994
5. Lowness properties and approximations of the jump;Figueira,2006