深度$Π^0_1$类
Deep $Π^0_1$ Classes
摘要:
一个无限二进制序列的集合$\mathcal{C}\subseteq2^ω$是可忽略的,如果没有部分概率算法产生这个集合的一个元素具有正概率。可忽略性的研究在$Π^0_1$类的上下文中特别有趣。在本文中,我们介绍了深度的概念,$Π^0_1$类,这是一个更强的形式的可忽略性。尽管可忽略的$Π^0_1$类$\mathcal{C}$具有不能以正概率概率地计算$\mathcal{C}$的成员的属性,但是深度$Π^0_1$类$\mathcal{C}$具有不能以高概率地计算$\mathcal{C}$的成员的初始段的属性。也就是说,计算深度$Π^0_1$类的长度$n$初始段的概率在$n$中有效地收敛到0。我们证明了一些基本结果的深度,可忽略性,和一个变量的可忽略性,我们称之为$\mathit{tt}$-可忽略性。我们还提供了一些在可计算性理论和算法随机性中自然出现的深层$Π^0_1$类的例子。我们还研究了深类的背景下,大规模的问题,我们研究了深类和算法的随机性的某些低的概念之间的关系,并建立了深类的成员和Chaitin的$Ω$的互信息量之间的关系。
英文摘要:
A set of infinite binary sequences $\mathcal{C}\subseteq2^ω$ is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probability. The study of negligibility is of particular interest in the context of $Π^0_1$ classes. In this paper, we introduce the notion of depth for $Π^0_1$ classes, which is a stronger form of negligibility. Whereas a negligible $Π^0_1$ class $\mathcal{C}$ has the property that one cannot probabilistically compute a member of $\mathcal{C}$ with positive probability, a deep $Π^0_1$ class $\mathcal{C}$ has the property that one cannot probabilistically compute an initial segment of a member of $\mathcal{C}$ with high probability. That is, the probability of computing a length $n$ initial segment of a deep $Π^0_1$ class converges to 0 effectively in $n$. We prove a number of basic results about depth, negligibility, and a variant of negligibility that we call $\mathit{tt}$-negligibility. We also provide a number of examples of deep $Π^0_1$ classes that occur naturally in computability theory and algorithmic randomness. We also study deep classes in the context of mass problems, we examine the relationship between deep classes and certain lowness notions in algorithmic randomness, and establish a relationship between members of deep classes and the amount of mutual information with Chaitin's $Ω$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。