arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1105.3050math.LOmath.GN
收藏

关系的相对可计算性与一致连续性

Relative Computability and Uniform Continuity of Relations

Arno Pauly, Martin Ziegler

摘要:

第二类可计算的实函数必然是连续的;这对于相对的,即基于预言机的计算仍然是正确的。相反,根据维尔斯特拉斯近似定理,每个连续f:[0,1]->R相对于某个预言是可计算的。在寻找相对可计算的多值函数f:[0,1]=>R(aka relations)的类似拓扑特征时,Brattka和Hertling(1994)考虑了两个概念:弱连续性(弱于相对可计算性)和强连续性(强于相对可计算性)。观察一致连续性在维尔斯特拉斯定理中起着至关重要的作用,我们提出并比较了几个概念的一致连续性的关系。这里,由于f(x)中y值的额外量化,出现了(线性)排序量词的新方法,但它们都不令人满意。因此,我们导致一致连续性的概念的基础上的Henkin量词,并证明它是必要的相对可计算性。事实上,迭代这个条件会产生一个严格的概念层次结构,每个概念都是必要的,Ω级也是相对可计算性的充分条件。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑