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

关于随机性和一般性的有效概念之间的相互作用

On the interplay between effective notions of randomness and genericity

Laurent Bienvenu, Christopher P. Porter

摘要:

在本文中,我们研究了使用有效的随机预言机计算有效的通用序列的能力和局限性。以前,我们知道每个2-随机序列计算一个1-类属序列(如Kautz所示),每个2-随机序列与每个2-类属序列形成图灵度中的最小对(如Nies,Stephan和Terwijn所示)。我们加强这些结果表明,每个Demuth随机序列计算一个1-通用序列(这回答了一个开放的问题所提出的Barmpalias,日,和刘易斯),每个Demuth随机序列形成一个最小的对每个PB-通用序列(其中PB-通用性是一个有效的概念,严格的通用性之间的1-通用性和2-通用性)。此外,我们证明,对于每一个comeager $\mathcal{G}\subseteq 2^ω$,有一些弱2-随机序列$X$计算一些$Y\in\mathcal{G}$,一个结果,使我们能够提供一个相当完整的分类,以各种概念的有效随机性如何相互作用的图灵度与各种概念的有效泛型。

英文摘要:

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every 2-random sequence forms a minimal pair in the Turing degrees with every 2-generic sequence (as shown by Nies, Stephan, and Terwijn). We strengthen these results by showing that every Demuth random sequence computes a 1-generic sequence (which answers an open question posed by Barmpalias, Day, and Lewis) and that every Demuth random sequence forms a minimal pair with every pb-generic sequence (where pb-genericity is an effective notion of genericity that is strictly between 1-genericity and 2-genericity). Moreover, we prove that for every comeager $\mathcal{G}\subseteq 2^ω$, there is some weakly 2-random sequence $X$ that computes some $Y\in\mathcal{G}$, a result that allows us to provide a fairly complete classification as to how various notions of effective randomness interact in the Turing degrees with various notions of effective genericity.

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

↑