1. [10] Nies, A., Computability and Randomness, vol. 51 of Oxford Logic Guides, Oxford University Press, Oxford, 2009.
2. [1] Anderson, B. A., “Automorphisms of the truth-table degrees are fixed on a cone,” Journal of Symbolic Logic, vol. 74 (2009), pp. 679–88.
3. [2] Ash, C. J., and J. Knight, Computable Structures and the Hyperarithmetical Hierarchy, vol. 144 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2000.
4. [3] Coles, R., R. Downey, and G. Laforte, personal communication, May 2010.
5. [4] Cooper, B., Computability Theory, Chapman and Hall/CRC, Boca Raton, Fla., 2004.