An operator embedding theorem for complexity classes of recursive functions

D. Alton, Diversity of speed-ups and embeddability in computational complexity, J. Symbolic Logic (to appear). Alton, 1972, Operator embeddability in computational complexity, Notices Am. Math. Soc., A Basu, 1969, On classes of computable functions, ACM Symp. on Theory of Computing, 55 Blum, 1967, A machine-independent theory of the complexity of recursive functions, J. ACM, 14, 332, 10.1145/321386.321395 McCreight, 1969, Classes of computable functions defined by bounds on computation Enderton, 1972, Degrees of computational complexity, J. Comput. System Sci., 6, 389, 10.1016/S0022-0000(72)80010-2 Feferman, 1962, Classifications of recursive functions by means of hierarchies, Trans. Am. Math. Soc., 104, 101, 10.1090/S0002-9947-1962-0142453-3 Machtey, 1972, Augmented loop languages and classes of computable functions, J. Comput. System Sci., 6, 603, 10.1016/S0022-0000(72)80032-1 Meyer, 1972, Computational speed-up by effective operators, J. Symbolic Logic, 37, 55, 10.2307/2272545 Meyer, 1968, Classification of functions by computational complexity, Proc. of the Hawaii Internl. Conf. on Sys. Sciences, 17 Mostowski, 1938, Über gewisse universelle Relationen, Ann. Polon. Math., 17, 117 Rogers, 1967 Sacks, 1963, Degrees of Unsolvability