Abstract
Recent work in recursion theory has shown that the primitive recursive schemas can be modified so as to generate only the “feasible” class of polynomial time computable functions. In contrast to Cobham’s characterization, the new algebraic formulation uses a more structured form of recursion (“predicative recursion”) to avoid referring to polynomial growth bounds. The overall project is to rework recursion theory with respect to computational complexity, using predicativity as a guiding idea.
This work is supported by University of Toronto Department of Computer Science Toronto
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Bellantoni, “Predicative Recursion and Computational Complexity”, PhD Thesis, University of Toronto, 1992. Available as Technical Report 264/92, Department of Computer Science, University of Toronto.
S. Bellantoni, “Further Complexity Characterizations Using Predicative Recursion”, Manuscript, 1992.
S. Bellantoni and S. Cook, “A New Recursion-Theoretic Characterization of the Polytime Functions”, computational complexityv. 2, p. 97–110, 1992. Extended Abstract appeared in Proc. 24th Symposium on the Theory Of Computing, 1992.
S. Bloch, “Functional Characterizations of Uniform Log-depth and Polylogdepth Circuit Families”, in Annual Conference on Structure in Complexity Theory, 1992.
S. Bloch, Divide and Conquer in Parallel Complexity and Proof Theory, Ph.D. Thesis, Department of Mathematics, University of California at San Diego, 1992.
S. Buss, “Bounded Arithmetic”, Ph.D. Dissertation, Princeton University, 1985; reprinted Bibliopolis, Naples, 1986.
S. Buss, “The polynomial hierarchy and intuitionistic bounded arithmetic”, Annual Conference on Structure in Complexity Theory, Springer-Verlag Lecture Notes in Computer Science 223, 1986.
A. Cobham, “The intrinsic computational difficulty of functions”. In Y. Bar-Hillel ed., Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, p. 24 – 30. North Holland, Amsterdam, 1964.
S. Cook and A. Urquhart, “Functional interpretations of feasibly constructive arithmetic”, Annals of Pure and Applied Logic(to appear). See also Technical Report 210/88, Department of Computer Science, University of Toronto, 1988.
L. Fegaras, T. Sheard, D. Stemple, “Uniform Traversal Combinators: Definition, Use and Properties”, in 11th International Conference on Automated Deduction, June 1992.
S. Feferman, “Systems of Predicative Analysis”, in The Philosophy of Mathematics, J. Hintikka ed., series: “Oxford Readings in Philosophy”, Oxford University Press, 1969.
J. Krajicek, G. Takeuti, “On Bounded \(\Sigma_1^1\) Polynomial Induction”, in Feasible Mathematics, S. Buss and P. Scott, eds., Birkhauser 1990.
D. Leivant, “A foundational delineation of computational feasibility”, in Sixth Annual IEEE Symposium on Logic in Computer Science (Amsterdam), IEEE Computer Society Press, 1991.
D. Leivant, “Subrecursion and lambda representation over free algebras (Preliminary summary)”, in Feasible Mathematics, S. Buss and P. Scott, eds., Birkhauser 1990.
D. Leivant, “Semantic characterizations of number theories”, Technical Report CMU-CS-90-169, School of Computer Science, Carnegie Mellon University, 1990.
D. Leivant, “Characterization of Complexity Classes in Higher-Order Logic”, in Second Annual IEEE Symposium on Logic in Computer Science, 1987.
D. Leivant, “Predicative recurrence and computational complexity I: Word recurrence and poly-time”, this volume.
V. Lifschitz, “Calculable Natural Numbers” in Intensional Mathematics, S. Shapiro, ed., series: Studies in Logic v. 113, North-Holland, 1985.
E. Nelson, Predicative Arithmetic, Princeton University Press, Princeton, 1986.
A. Nguyen, A Formal System for Linear Space Reasoning, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1993.
J. Otto, “Categorical Characterization of Ptime I”, manuscript, Dept. of Mathematics, McGill University, 1991.
T. Pitassi, “The Efficiency of Weak Formal Systems”, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1992.
R. W. Ritchie, “Classes of Predictably Computable Functions”, Transactions of the American Mathematical Society, v. 106, 1963.
H. Simmons, “The Realm of Primitive Recursion”, Archive for Mathematical Logic, v. 27 p. 177+, Springer Verlag 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Birkhäuser Boston
About this paper
Cite this paper
Bellantoni, S. (1995). Predicative Recursion and The Polytime Hierarchy. In: Clote, P., Remmel, J.B. (eds) Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol 13. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-2566-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2566-9_2
Publisher Name: Birkhäuser Boston
Print ISBN: 978-1-4612-7582-4
Online ISBN: 978-1-4612-2566-9
eBook Packages: Springer Book Archive