Abstract
Primitive recursion is the fundamental example of “recursive definition”. It is intimately related with “for-loops” in programming, and with the E1induction rule in proof theory. Though the primitive recursive functions contain many fast-growing “non-feasible” functions, recent work of Bellantoni-Cook and others shows how a natural two-sorted restriction of primitive recursion serves to characterize complexity classes such as polynomial time and linear space. The lectures presented here provide a technical introduction to this area.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bellantoni S.Predicative Recursion and Computational Complexity.Ph.D. Thesis, University of Toronto, 1992.
Bellantoni S. and Cook S. ANew Recursion Theoretic Characterization of the Polytime Functions.Computational Complexity Vol. 2, 1992, 97–110.
Bellantoni S.Predicative Recursion and the Polytime Hierarchy.In Clote P. and Remmel J. (Eds) Feasible Mathematics II, Birkhäuser 1995, 15–29.
Börger E.Computability complexity logic. North-Holland Studies in Logic Vol. 128, 1989.
Constable R.L. and Borodin A.B.Subrecursive programming languages. Part 1: efficiency and program structure.JACM Vol.19, 1972, 526–568.
Cleave J.P.A hierarchy of primitive recursive functions.Zeit. Math. Logik. und Grund. Vol.9, 1963, 331–345.
Grzegorczyk, A.Some classes of recursive functions.Rozprawy Matematyczne IV, Warsaw 1953.
Leivant D.Intrinsic theories and computational complexity.In Leivant D. (Ed) Logic and Computational Complexity, Springer Lect. Notes in Comp. Science Vol.960, 1994, 177–194.
Leivant D.Ramified recurrence and computational complexity.In Clote P. and Remmel J. (Eds) Feasible Mathematics II, Birkhäuser 1995, 320–343.
Péter R.Recursive functions.Academic Press 1967.
Ritchie R.W.Classes of predictably computable functions.Trans. Amer. Math. Soc. Vol.106, 1963, 139–173.
Rödding D.Klassen rekursiver funktionen.In Löb M. (Ed) Proc. Leeds Summer School in Logic, Springer Lect. Notes in Math. Vol.70, 1968, 159–222.
Rose H.E.Subrecursion - functions and hierarchies.Oxford Logic Guides Vol.9, Clarendon Press Oxford 1984.
Schwichtenberg H.Rekursionszahlen und die Grzegorczyk hierarchie.Archiv f. Math. Logik und Grund. Vol.12, 1969, 85–97.
Sieg W. and Wainer S.Program Transformation and Proof Transformation.In Börger E., Gurevich Y. and Meinke K. (Eds) Computer Science Logic ‘83, Springer Lect. Notes in Comp. Science Vol.832, 1994, 305–317.
Simmons H.The realm of primitive recursion.Archive Math. Logic Vol.27, 1988, 177–188.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Handley, W.G., Wainer, S.S. (1999). Complexity of Primitive Recursion. In: Berger, U., Schwichtenberg, H. (eds) Computational Logic. NATO ASI Series, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58622-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-58622-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63670-7
Online ISBN: 978-3-642-58622-4
eBook Packages: Springer Book Archive