Abstract
We give a recursion-theoretic characterization of FP which describes polynomial time computation independently of any externally imposed resource bounds. In particular, this syntactic characterization avoids the explicit size bounds on recursion (and the initial function 2|x|·|y|) of Cobham.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Allen, “Arithmetizing Uniform NC”,Annals of Pure and Applied Logic, p. 1–50, v. 53 (1991).
S. Bellantoni, “Predicative Recursion and Computational Complexity”, PhD Thesis, University of Toronto, 1992 (to appear).
S. Bellantoni and S. Cook, “A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)”, inProc. 24th Symposium on the Theory Of Computing, ACM, 1992.
S. Bloch, “Functional Charaterizations of Uniform Log-depth and Polylogdepth Circuit Families”, inProc., Structure in Complexity Theory, to appear, IEEE, 1992.
S. Buss, “Bounded Arithmetic”, Ph.D. Dissertation, Princeton University, 1985; reprinted Bibliopolis, Naples, 1986.
P. Clote, “Sequential, machine-independent characterizations of the parallel complexity classesAlog TIME, AC k, NCk and NC.” MSI Workshop on Feasible Mathematics, p. 49–70, Birkhauser, 1989.
P. Clote, G. Takeuti, “Exponential Time and Bounded Arithmetic“, inAnnual Conference on Structure in Complexity Theory, v. 1, p. 125–143, 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, “Feasibly constructive proofs and the propositional calculus”,Proc. 7th Symposium on the Theory Of Computing, p. 83–97, ACM, 1975.
S. Cook, “Computability and complexity of higher type functions.”Proc. MSRI Workshop on Logic from Computer Science, p. 51–72, Y. Moschovakis, ed., Springer Verlag, 1992.
S. Cook and B. Kapron, “Characterizations of the Basic Feasible Functionals of Finite Type”,Feasible Mathematics, p. 71–95, S. R. Buss and P. J. Scott eds., Birkhauser, 1990.
S. Cook and A. Urquhart, “Functional interpretations of feasibly constructive arthmetic”,Annals of Pure and Applied Logic (to appear). Extended abstract appears inProc. 21st Symposium on the Theory of Computing, p. 107–112, ACM, 1989.
L. Fegaras, T. Sheard, D. Stemple, “Uniform Traversal Combinators: Definition, Use and Properties”, in11th International Conference on Automated Deduction, June 1992.
Y. Gurevich, “Algebras of Feasible Functions”,Proc. 24th IEEE Conference on Foundations of Computer Science, p. 210–214, 1983.
N. Immerman, “Languages That Capture Complexity Classes”,SIAM Journal of Computing, p. 760–778, v. 16 (1987).
D. Leivant, “A foundational delineation of computational feasibility”, inProc. Sixth Annual IEEE Symposium on Logic in Computer Science, p. 2–11, IEEE, 1991.
D. Leivant, “Subrecursion and lambda representation over free algebras (Preliminary summary)”,Feasible Mathematics, p. 281–292, S. Buss and P. Scott, eds., Birkhauser 1990.
D. Leivant, J-Y. Marion, “Purely applicative characterization of complexity classes (Extended Abstract)”, typescript, Department of Computer Science, Indiana University, April 1992.
D. Leivant, J-Y. Marion, “Capturing poly-time in a typed λ-calculus”, typescript, Department of Computer Science, Indiana University, April 1992.
E. Nelson,Predicative Arithmetic, Princeton Unversity Press, Princeton, 1986.
J. Otto, “Categorical Characterization of Ptime I”, manuscript, Dept. of Mathematics, McGill University, 1991.
H. E. Rose,Subrecursion: functions and hierarchies, Oxford Logic Guides 9, Clarendon Press, Oxford, 1984.
R. W. Ritchie, “Classes of Predictably Computable Functions”,Transactions of the American Mathematical Society, p. 139–173, v. 106 (1963).
A. Seth, “There is no Recursive Axiomatization for Feasible Functionals of Type 2” inProc. Seventh Annual IEEE Symposium on Logic in Computer Science, to appear, IEEE, 1992.
G. J. Tourlakis,Computability, Reston, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bellantoni, S., Cook, S. A new recursion-theoretic characterization of the polytime functions. Comput Complexity 2, 97–110 (1992). https://doi.org/10.1007/BF01201998
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01201998