arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.04451math.LO
收藏

相对化深度

Relativized depth

Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle

摘要:

班尼特的深度概念通常被认为是描述编码到一个对象(如无限二进制序列)中的信息的有用性和内部组织。我们认为一个自然的方式来相对化的概念,这样的集的深度,我们调查各种各样的神谕是否以及如何的非相对化和相对化版本的深度不同。直观地说,访问Oracle会增加计算能力。因此,对于可计算性理论中考虑的集合的大多数概念,对于相应的类,对于所有预言机,非相对化类包含在相对化类中,或者对于所有预言机,相对化类包含在非相对化类中。这两种情况的例子分别由可计算和马丁-勒夫随机集的类给出。然而,在深度的情况下,情况有所不同。事实证明,深集合类和相对于停集$\emptyset '$深的集合类在集合论包含方面是不可比拟的。另一方面,深集类严格包含在相对于任何给定的马丁-洛夫-随机预言机深的集合类中。在后一个结果的证明中建立的集合也可以用来给出一个已知事实的简短证明,即每个PA-完全度都是图灵等价于两个马丁-勒夫-随机集的并。事实上,我们通过证明每个DNC $_2$函数都是真值表等价于两个Martin-Löf随机集的连接来稍微加强这个结果。此外,我们观察到,相对于任何给定的K-平凡预言的深集类要么与深集类相同,要么严格包含在深集类中。显然,前一种情况适用于可计算预言机。我们离开它作为一个开放的问题,这两种可能性可能发生的不可计算的K-平凡的神谕。

英文摘要:

Bennett's notion of depth is usually considered to describe the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence. We consider a natural way to relativize the notion of depth for such sets, and we investigate for various kinds of oracles whether and how the unrelativized and the relativized version of depth differ. Intuitively speaking, access to an oracle increases computation power. Accordingly, for most notions for sets considered in computability theory, for the corresponding classes trivially for all oracles the unrelativized class is contained in the relativized class or for all oracles the relativized class is contained in the unrelativized class. Examples for these two cases are given by the classes of computable and of Martin-Löf random sets, respectively. However, in the case for depth the situation is different. It turns out that the classes of deep sets and of sets that are deep relative to the halting set $\emptyset '$ are incomparable with respect to set-theoretical inclusion. On the other hand, the class of deep sets is strictly contained in the class of sets that are deep relative to any given Martin-Löf-random oracle. The set built in the proof of the latter result can also be used to give a short proof of the known fact that every PA-complete degree is Turing-equivalent to the join of two Martin-Löf-random sets. In fact, we slightly strengthen this result by showing that every DNC$_2$ function is truth-table-equivalent to the join of two Martin-Löf random sets. Furthermore, we observe that the class of deep sets relative to any given K-trivial oracle either is the same as or is strictly contained in the class of deep sets. Obviously, the former case applies to computable oracles. We leave it as an open problem which of the two possibilities can occur for noncomputable K-trivial oracles.

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

↑