Resource-Bounded Continuity and Sequentiality for Type-Two Functionals

ACM Transactions on Computational Logic

Volumn 3, Issue 3, 2002, Pages 402-417

  Buss, Samuel R ^a   Kapron, Bruce M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; decision trees; Higher order complexity; sequential computation; Theory

Indexed keywords

EID: 85016868854     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/507382.507387     Document Type: Article

References (23)

1. Berger, U. 1993. Total sets and objects in domain theory. Ann. Pure Appl. Logic 60, 2 (April), 91-117.
2. Blum, M. And Imagliazzo, R. 1987. Generic oracles and oracle classes. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, CA, 118-126.
3. Cook, S. 1990. Computability and complexity of higher type functions. In Proceedings of the MSRI Workshop on Logic from Computer Science, Y. Moschovakis, Ed. Springer-Verlag, Berlin, Germany, 51-72.
4. Cook, S. And Kapron, B. 1990. Characterizations of the basic feasible functionals of finite type. In Feasible Mathematics, S. Buss and P. Scott, Eds. Birkhauser, Boston, MA, 71-93.
5. Gandy, R. And Hyland, M. 1977. Computable and recursively countable functions of higher type. In Logic Colloquium '76, R. Gandy and M. Hyland, Eds. North-Holland, Amsterdam, The Netherlands, 407-438.
6. Graham, R., Rothschild, B., And Spencer, J. 1990. Ramsey Theory, 2nd ed. John Wiley and Sons, Inc., New York, NY.
7. Hartmanis, J. And Hemachandra, L. 1990. Robust machines accept easy sets. Theoret. Comput. Sci. 74, 2 (Aug.), 217-225.
8. Impagliazzo, R. And Naor, M. 1988. Decision trees and downward closures. In Proceedings of the 3rd Annual IEEE Structure in Complexity Theory. IEEE Computer Society Press, Los Alamitos, CA, 29-38.
9. Kapron, B. 1991. Feasible computation in higher types. Ph.D. thesis, Department of Computer Science, University of Toronto, Toronto, Ont., Canada.
10. Kapron, B. 1999. Feasibly continuous type-two functionals. Computat. Complex. 8, 2, 188-201.
11. Kapron, B. And Cook, S. 1996. A new characterization of type-2 feasibility. SIAMJ. Comput. 25, 1 (Feb.), 117-132.
12. Kleene, S. 1959a. Countable functionals. In Constructivity in Mathematics, A. Heyting, Ed. North-Holland, Amsterdam, The Netharlands, 81-100.
13. Kleene, S. 1959b. Recursive functionals and quantifiers of finite types I. Trans. Amer. Math. Soc. 91, 1 (April), 1-52.
14. Kleene, S. 1963. Recursive functionals and quantifiers of finite types II. Trans. Amer. Math. Soc. 108, 1 (July), 106-142.
15. Ko, K.-I. 1986. Applying techniques of discrete complexity theory to numerical computation. In Studies in Complexity Theory, R. Book, Ed. Pitman Publishing Ltd., London, U.K., 1-62.
16. Kreisel, G. 1959. Interpretation of analysis by means of functionals of finite type. In Construc-tivity in Mathematics, A. Heyting, Ed. North-Holland, Amsterdam, The Netherlands, 101-128.
17. Longley, J. 1998. The sequentially realizable functionals. Tech. Rep. ECS-LFCS-98-402, LFCS, University of Edinburgh, Edinburgh, U.K.
18. Mehlhorn, K. 1976. Polynomial and abstract subrecursive classes. J. Comput. Syst. Sci. 12, 2 (April), 147-178.
19. Normann, D. 1998. Computability over the partial continuous functionals (rev. version). Pure Mathematics Preprint Series 1998 2, Department of Mathematics, University of oslo, oslo, Norway.
20. Plotkin, G. 1999. Full abstraction, totality and PCF. Math. Struct. Comp. Sci. 9, 1 (Feb.), 1-20.
21. Tabdos, G. 1989. Query complexity, or why is it difficult to separate NPa N co-NPa from Pa by a random oracle? Combinatorica 9, 4, 385-392.
22. Townsend, M. 1990. Complexity for type-2 relations. Notre Dame J. Formal Logic 31, 2 (Spring), 241-262.
23. Van Oosten, J. 1999. A combinatory algebra for sequential functionals of finite type. In Models and Computability: Invited Papers from Logic Colloquium '97, S. Cooper and J. Truss, Eds. Cambridge University Press, Cambridge, U.K.