Abstract.
A well-known theorem of type-two recursion theory states that a functional is continuous if and only if it is computable relative to some oracle. We show that a feasible analogue of this theorem holds, using techniques originally developed in the study of Boolean decision tree complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 9, 1996.
Rights and permissions
About this article
Cite this article
Kapron, B. Feasibly continuous type-two functionals. comput. complex. 8, 188–201 (1999). https://doi.org/10.1007/s000370050027
Issue Date:
DOI: https://doi.org/10.1007/s000370050027