References
Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the Association of Computing Machinery14, 322–336 (1967).
Constable, R.L.: The operator gap. Journal of the Association of Computing Machinery19, 175–183 (1972).
Di Paola, R.A.: The operator gap theorem in α-recursion theory. Notices of the American Mathematical Society, Vol. 23, No. 5, August 1976, p. A-504.
Jacobs, B.: On generalized computational complexity. The Journal of Symbolic Logic, Vol. 42, No. 1, pp. 47–58 (1977).
Jacobs, B.: α-Naming and α-speedup theorems (to appear in the Notre Dame Jour. of Formal Logic).
Kreisel, G., Lacombe, D., Shoenfield, J.R.: Partial recursive functionals and effective operations. In: Heyting, A. (ed.): Constructivity in mathematics: proceedings of the colloquium held at Amsterdam, pp. 195–207. Amsterdam: North-Holland Publ. Co. 1957.
Kripke, S.: The theory of transfinite recursions (unpublished class notes by A.T. Tymoczko).
McCreight, E., Meyer, A.: Classes of computable functions defined by bounds on computation. Preliminary report, Proceedings of ACM Symposium on Theory of Computing (1969), pp. 79–88.
Rabin, M.O.: Degrees of difficulty of computing a function and a partial ordering of recursive sets. Tech. Rep. 2, Hebrew University, Jerusalem (1960).
Sacks, G. E., Simpson, S.: The α-finite injury method. Ann. Math. Logic4, 343–368 (1972).
Author information
Authors and Affiliations
Additional information
The preparation of this paper was supported in part by a grant from the City University of New York, Faculty Research Award Program.
We wish to acknowledge helpful comments of the referee regarding several expository points.
Rights and permissions
About this article
Cite this article
Di Paola, R.A. The operator gap theorem in α-recursion theory. Arch math Logik 19, 115–129 (1978). https://doi.org/10.1007/BF02011873
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02011873