Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K. (1973). The "almost all" theory of subrecursive degrees is decidable. Ithaca, NY, USA: IEEE.