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

密度1集的通有度与超算术实的刻画

The Generic Degrees of Density-1 Sets, and Characterization of the Hyperarithmetic Reals

Gregory Igusa

摘要:

$\mathbb{N}$的子集$A$的通用计算是正确地计算$A$的大多数比特的计算,但是其潜在地不在所有输入上停止。这个概念的动机来自复杂性理论,人们注意到,通常情况下,知道一种类型的问题在一般情况下有多困难比在最坏情况下有多困难更重要。当我们从递归理论的角度研究这个概念时,为了创建一个传递关系,我们不得不考虑有时在被问到问题时无法给出答案的神谕。不幸的是,这使得在通用程度的工作相当困难。事实上,我们表明,通用的减少是$\mathbfΠ^1_1-$完成。为了避免这个困难,我们使用密度为1的实数的泛度。我们演示了如何理解这些度导致更好地理解的整体结构的通用度,我们也使用这些密度-1集提供了一个新的表征的hyperarithmetical图灵度。

英文摘要:

A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory, where it has been noticed that frequently, it is more important to know how difficult a type of problem is in the general case than how difficult it is in the worst case. When we study this concept from a recursion theoretic point of view, to create a transitive relationship, we are forced to consider oracles that sometimes fail to give answers when asked questions. Unfortunately, this makes working in the generic degrees quite difficult. Indeed, we show that generic reduction is $\mathbfΠ^1_1-$complete. To help avoid this difficulty, we work with the generic degrees of density-1 reals. We demonstrate how an understanding of these degrees leads to a greater understanding of the overall structure of the generic degrees, and we also use these density-1 sets to provide a new a characterization of the hyperartithmetical Turing degrees.

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

↑