Relative computability and uniform continuity of relations

Abstract

We are thus led to a concept of uniform continuity based on the Henkin quantifer and prove it necessary for relative computability of compact real relations. In fact iterating this condition yields a strict hierarchy of notions each necessary—and w-the level also sufficient— for relative computability. A refined, quantitative analysis exhibits a similar topological characterization of relative polynomialtime computability.