Mehlhorn, K. (1974). The 'almost all' theory of subrecursive degrees is decidable. In Automata, languages and programming: 2nd colloquium (ICALP-74) (pp. 317-325). Berlin, Germany: Springer.