The Random Members of a ?10${\Pi }_{1}^{0}$ Class

Periodicals(2018)

引用 0|浏览6
暂无评分
摘要
AbstractWe examine several notions of randomness for elements in a given ?10${\Pi }_{1}^{0}$ class P$\mathcal {P}$. Such an effectively closed subset P$\mathcal {P}$ of 2?may be viewed as the set of infinite paths through the tree TP$T_{\mathcal {P}}$ of extendible nodes of P$\mathcal {P}$, i.e., those finite strings that extend to a member of P$\mathcal {P}$, so one approach to defining a random member of P$\mathcal {P}$ is to randomly produce a path through TP$T_{\mathcal {P}}$ using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of P$\mathcal {P}$ may be induced by a map from 2?onto P$\mathcal {P}$ that is computable relative to TP$T_{\mathcal {P}}$, and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on P$\mathcal {P}$ by conditionalizing the Lebesgue measure on P$\mathcal {P}$, which becomes interesting if P$\mathcal {P}$ has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of P$\mathcal {P}$ in terms of the amount of branching at levels of TP$T_{\mathcal {P}}$. We explore some notions of homogeneity for ?10${\Pi }_{1}^{0}$ classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous ?10${\Pi }_{1}^{0}$ classes P$\mathcal {P}$, all of these approaches coincide. We conclude with a discussion of random members of ?10${\Pi }_{1}^{0}$ classes of positive measure.
更多
查看译文
关键词
Algorithmic randomness,Computability theory,Pi(0)(1) classes,Kolmogorov complexity,Non-uniform probability measures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要