Anderson, B. A., Relatively computably enumerable reals. Archive for Mathematical Logic, vol. 50 (2011), no. 3–4, pp. 361–365.
Cai, M. and Shore, R., Domination, forcing, array nonrecursiveness and relative recursive enumerability, this Journal, vol. 77 (2012), pp. 226–239.
Downey, R. and Hirschfeldt, D., Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, 2010.
Jockusch, C. G. Jr., Degrees of generic sets, Recursion Theory: Its Generalizations and Applications, Proceedings of Logic Colloquium ’79 (Drake, F. R. and Wainer, S. S., editors), Cambridge University Press, Cambridge, 1980, pp. 110–139.
Kumabe, M., Relative recursive enumerability of generic degrees, this Journal, vol. 56 (1991), no. 3, pp. 1075–1084.
Kumabe, M., Degrees of generic sets, Computability, Enumerability, Unsolvability (Cooper, S. B., Slaman, T. A., and Wainer, S. S., editors), London Mathematical Society, Lecture Notes Series, vol. 224, Cambridge University Press, Cambridge, 1996, pp. 167–183.
Kurtz, S., Randomness and genericty in the degrees of unsolvability, Ph.D. thesis, University of Illinios at Urbana-Champaign, 1981.
Yates, C. E. M., Initial segments of the degrees of unsolvability, part II: Minimal degrees, this Journal, vol. 35 (1970), pp. 243–266.