Cooper, B. S., 01 2008, private communication.
Kjos-Hanssen, B., A rigid cone in the truth-table degrees with jump, arXiv: 0901:3949 [math. LO], preprint.
Kjos-Hanssen, B., 04 2008, private communication.
Kjos-Hanssen, B., Merkle, W., and Stephan, F., Kolomogorov complexity and the recursion theorem, STACS 2006: 23rd annual Symposium on Theoretical Aspects of Computer Science (Marseilles, France), Lecture Notes in Computer Science, vol. 3884, Springer, 2006, pp. 149–161.
Kučera, A., 11 2007, private communication.
Kučera, A. and Slaman, T. A., Low upper bounds of ideals, preprint.
Kumabe, M. and Lewis, A., A fixed point free minimal degree, preprint.
Miller, J. S., Π10 classes in computable analysis and topology, Ph.D. thesis, Cornell University, 2002.
Mohrherr, J., Density of a final segment of the truth-table degrees, Pacific Journal of Mathematics, vol. 115 (1984), pp. 409–419.
Mytilinaios, M. E. and Slaman, T. A., Differences between resource bounded degree structures, Notre Dame Journal of Formal Logic, vol. 44 (2003), no. 12, pp. 1–12.
Nerode, A. and Shore, R. A., Reducibility orderings: theories, definability, and automorphisms, Annals of Mathematics, vol. 18 (1980), pp. 61–89.
Odifreddi, P. G., Classical recursion theory, Elsevier, 1999.
Sacks, G. E., Recursive enumerability and the jump operator, Transactions of the American Mathematical Society, vol. 108 (1963), no. 2, pp. 223–239.
Shore, R. A., Rigidity and biinterpretability in the hyperdegrees, Recursion theory workshop: Proceedings of the IMS program, Computational prospects of infinity (Chong, C. T., Qi, F., and Yang, Y., editors), World Scientific Publishing Company, 2007, to appear.
Shore, R. A., 02 2008, private communication.
Shore, R. A. and Slaman, T. A.. Defining the Turing jump, Mathematical Research Letters, vol. 6 (1999), no. 5–6, pp. 711–722.
Slaman, T. A. and Woodin, W. H., Decidability in degree structures, to appear.
Soare, R. I., Recursively enumerable sets and degrees, Springer-Verlag, 1987.