Resource-Bounded Continuity and Sequentiality for Type-Two Functionals

Authors:
Samuel R. Buss;Bruce Kapron
Affiliations:
-;-
Venue:
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Year:
2000

Citing 6
Cited 0

Robust machines accept easy sets

Theoretical Computer Science
A New Characterization of Type-2 Feasibility

SIAM Journal on Computing
Feasibly continuous type-two functionals

Computational Complexity
Full abstraction, totality and PCF

Mathematical Structures in Computer Science
Generic oracles and oracle classes

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Polynomial and abstract subrecursive classes

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.