A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to some oracle.
In their search for a similar topological characterization of relatively computable multivalued functions f:[0,1]=>R (aka relations), Brattka and Hertling (1994) have considered two notions: weak continuity (which is weaker than relative computability) and strong continuity (which is stronger than relative computability). Observing that uniform continuity plays a crucial role in the Weierstrass Theorem, we propose and compare several notions of uniform continuity for relations. Here, due to the additional quantification over values y in f(x), new ways of (linearly) ordering quantifiers arise, yet none of them turn out as satisfactory.
We are thus led to a notion of uniform continuity based on the Henkin Quantifier; and prove it necessary for relative computability. In fact iterating this condition yields a strict hierarchy of notions each necessary, and the omega-th level also sufficient, for relative computability.
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
在这篇文章中,我们处理一个多值函数$F$的连续性的概念,我们计算的描述集理论的复杂性的集合的所有$x$为$F$是连续的$x$。我们给出了后一个集合是$G_δ$集合或$G_δ$集合的可数并的条件。并给出了一个反例,说明在相同条件下,后一个结果是最优的.此外,我们证明了这些条件是必要的,以获得连续的点集的$F$是Borel,即,我们证明了如果我们放弃一些前面的条件,那么有一个多值函数$F$,它的图是一个Borel集和一组点连续的$F$是不是一个博雷尔集。最后,我们给出了一些类似的结果,一个更强的概念,连续性的多值函数。这篇文章是由M. Ziegler在[{ \em Real Computation with Least Discrete Advice:A Complexity Theory of Nonuniform Computability with Applications to线性代数},{ \sl submitted}].
Decidable fan theorem and uniform continuity theorem with continuous moduli
一致连续性定理(UCT)指出单位区间上的每一个逐点连续的实值函数都是一致连续的。在构造性数学中,UCT比可判定扇定理(DFT)更强;然而,Loeb [Ann. Pure Appl. Logic,132(1):51-66,2005]已经表明,通过将“连续函数“适当编码为第一类对象,这两个原理变得等价。问题仍然是DFT是否可以通过使用逐点连续函数的自然子类而不使用这种编码的较弱版本的UCT来表征。我们表明,当“逐点连续”被替换为“具有连续模”,UCT变得等价于DFT。我们还表明,这种弱化的UCT是相当于一个类似的康托空间$\{0,1\}^{\mathbb{N}}$上的实值函数的原则。这些结果通过对从$\{0,1\}^{\mathbb{N}}$到$\mathbb{N}$的函数的相似原理扩展了Berger的DFT的特征,并且统一了DFT的这些特征在具有连续模的函数方面.此外,我们还直接证明了单位区间上具有连续模的连续实值函数正是那些允许由Loeb提出的“连续函数“编码的函数.我们的结果使我们能够解释她的工作在通常的数学背景下。