On the computational complexity of type 2 functionals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1414, Issue , 1998, Pages 373-388

  Pezzoli, Elena ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; MACHINERY; POLYNOMIAL APPROXIMATION; RECONFIGURABLE HARDWARE; TURING MACHINES;

FUNCTIONALS; INPUT FUNCTIONS; MACHINE CHARACTERIZATION; POLYNOMIAL-TIME; REAL NUMBER;

C (PROGRAMMING LANGUAGE);

EID: 0042022363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028026     Document Type: Conference Paper

References (16)

1. J.L. Balcazar and J.D. Gabarro Structural Complexity I and II Springer Verlag (1988)
2. A. Cobham The intrinsic computational difficulty of functions. Proceedings of the 1964 International Congress for Logic, Methodology and the Philosophy of Science, Y. Bar-Hillel ed., North Holland, (1964) pp. 24-30
3. R. Constable Type two computational complexity. Proceedings 5th STOC (1973) pp. 108-121
4. S.A. Cook. Computability and complexity of higher type functions. MSRI Proceedings, Y.N. Moschovakis editor, Logic from Computer Science, Springer-Verlag (1990). pp. 51-72
5. S.A. Cook Computational Complexity of Higher Type Functions In Proceedings of the International Congress of Mathematicians, Kyoto (1990) pp. 55-69
6. S.A. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic 63 (1993), pp. 103-200.
7. S.A. Cook and B.M. Kapron, Characterizations of the basic feasible functionals of finite type. Proceedings of MSI workshop on feasible Mathematics, S. Buss and J. Scott editors, perspective in computer Science, Birkhauser-Boston, New York (1990). pp. 71-95
8. B.M. Kapron and S.A. Cook A new characterization of Type 2 Feasibility. SIAM J. Comput 25 No 1 (1996). pp. 117-132
9. Ker-I-Ko. Complexity theory of real functions. Birkhauser-Boston, New-York (1991)
10. B.M. Kapron. Feasible computation in higher types. PH.D Thesis. Technical report, University of Toronto. (1991)
11. A. Ignjatovic On feasibility in higher types Manuscript.
12. K. Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System sciences 12 (1976). pp. 148-176
13. E. Pezzoli On the Computational Complexity of Functionals and Logical Games Ph.D thesis. Stanford University. In preparation
14. A. Seth There is no recursive axiomatization for feasible functionals of type 2. Seventh annual IEEE Symposium in Logic in Computer Science (1992).
15. A. Seth Complexity theory of higher type functionals. Ph.D Thesis. University of Bombay. (1994)
16. M. Townsend. Complexity for type 2 relations. Notre Dame Journal of formal Logic (1990) pp. 241-262.