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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
