A new characterization of type-2 feasibility

SIAM Journal on Computing

Volumn 25, Issue 1, 1996, Pages 117-132

  Kapron, B M ^a   Cook, S A ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Notational recursion; Oracle Turing machine; Polynomial time; Type 2 computability

Indexed keywords

TURING MACHINES;

FEASIBILITY; NOTATION; ORACLE; POLYNOMIAL TIME; RECURSIVITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0029747865     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794263452     Document Type: Article

References (10)

1. A. COBHAM, The intrinsic computational difficulty of functions, Proc. 1964 International Congress for Logic, Methodology, and the Philosophy of Science, North-Holland, Amsterdam, 1964.
2. S. A. COOK, Iterated recursion is PV-definable, manuscript, 1989.
3. _, Computability and complexity of higher-type functions, in Logic from Computer Science, Springer-Verlag, Berlin, 1992, pp. 51-72.
4. S. A. COOK AND B. M. KAPRON, Characterizations of the basic feasible functional of finite type, in Feasible Mathematics, Birkhauser, Boston, 1990, pp. 71-95.
5. H. FRIEDMAN AND K. KO, Computational complexity of real functions, Theoret. Comput. Sci., 20 (1982), pp. 323-352.
6. A. IGNJATOVIČ, On feasibility in higher types, manuscript, 1994.
7. B. M. KAPRON, Feasible computation in higher types, Tech. report 249/91, Department of Computer Science, University of Toronto, Toronto, ON, 1991.
8. B. M. KAPRON AND S. A. COOK, A new characterization of Mehlhorn's poly-time functionals, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, San Juan, PR, 1991, pp. 342-347.
9. K. MEHLHORN, Polynomial and abstract subrecursive classes, J. Comput. System Sci., 12 (1976), pp. 147-178.
10. M. TOWNSEND, Complexity for type-2 relations, Notre Dame J. Formal Logic, 31 (1990), pp. 241-262.