Resource-bounded continuity and sequentiality for type-two functionals

We define notions of resource-bounded continuity and sequentiality for type-two functionals with total inputs, and prove that in the resource-bounded model there are continuous functionals which cannot be efficiently simulated by sequential functionals. We also show that for some naturally defined classes of continuous functionals, an efficient simulation is possible.

[1]  D. Normann.  The countable functionals , 1980 .

[2]  R. Gandy,et al.  Computable and recursively countable functions of higher type , 1977 .

[3]  Mike Townsend,et al.  Complexity for Type-2 Relations , 1990, Notre Dame J. Formal Log..

[4]  Juris Hartmanis,et al.  Robust Machines Accept Easy Sets , 1990, Theor. Comput. Sci..

[5]  Gábor Tardos,et al.  Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? , 1989, Comb..

[6]  J. V. Oosten,et al.  A combinatory algebra for sequential functionals of finite type , 1997 .

[7]  A. Nerode,et al.  Review: S. C. Kleene, Recursive Functionals and Quantifiers of Finite Types I , 1962 .

[8]  Dag Normann.  Computability over The Partial Continuous Functionals , 2000, J. Symb. Log..

[9]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[10]  John Longley.  The sequentially realizable functionals , 2002, Ann. Pure Appl. Log..

[11]  Kurt Mehlhorn.  Polynomial and Abstract Subrecursive Classes , 1976, J. Comput. Syst. Sci..

[12]  Bruce M. Kapron.  Feasibly continuous type-two functionals , 1999, computational complexity.

[13]  Moni Naor,et al.  Decision trees and downward closures , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[14]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[15]  Bruce M. Kapron,et al.  Characterizations of the basic feasible functionals of finite type , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Bruce M. Kapron.  Feasible computation in higher types , 1992 .

[17]  Ulrich Berger,et al.  Total Sets and Objects in Domain Theory , 1993, Ann. Pure Appl. Log..

[18]  S. C. Kleene,et al.  Recursive functionals and quantifiers of finite types. II , 1959 .

[19]  D. Normann.  Recursion on the countable functionals , 1980 .

[20]  Stephen A. Cook,et al.  Computability and Complexity of Higher Type Functions , 1992 .

[21]  Gordon D. Plotkin,et al.  Full abstraction, totality and PCF , 1999, Mathematical Structures in Computer Science.

[22]  Bruce M. Kapron,et al.  A New Characterization of Type-2 Feasibility , 1996, SIAM J. Comput..