Feasibly continuous type-two functionals

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 s how that a feasible analogue of this theorem holds, using techniques origin ally developed in the study of Boolean decision tree complexity.