Computing from Projections of Random Points

J. Math. Log.(2020)

引用 5|浏览25
暂无评分
摘要
We study the sets that are computable from both halves of some (Martin-Lof) random sequence, which we call 1/2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterize 1/2-bases as the sets computable from both halves of Chaitin's Omega, and as the sets that obey the cost function c(x, s) = root Omega(s) - Omega(x). Generalizing these results yields a dense hierarchy of subideals in the K-trivial degrees: For k < n, let B-k/n be the collection of sets that are below any k out of n columns of some random sequence. As before, this is an ideal generated by its c.e. elements and the random sequence in the definition can always be taken to be Omega. Furthermore, the corresponding cost function characterization reveals that B-k/n is independent of the particular representation of the rational k/n, and that B-p is properly contained in B-q for rational numbers p < q. These results are proved using a generalization of the Loomis-Whitney inequality, which bounds the measure of an open set in terms of the measures of its projections. The generality allows us to analyze arbitrary families of orthogonal projections. As it turns out, these do not give us new subideals of the K-trivial sets; we can calculate from the family which B-p it characterizes. We finish by studying the union of B-p for p < 1; we prove that this ideal consists of the sets that are robustly computable from some random sequence. This class was previously studied by Hirschfeldt [D. R. Hirschfeldt, C. G. Jockusch, R. Kuyper and P. E. Schupp, Coarse reducibility and algorithmic randomness, J. Symbolic Logic 81(3) (2016) 1028-1046], who showed that it is a proper subclass of the K-trivial sets. We prove that all such sets are robustly computable from Omega, and that they form a proper subideal of the sets computable from every (weakly) LR-hard random sequence. We also show that the ideal cannot be characterized by a cost function, giving the first such example of a Sigma(0)(3) subideal of the K-trivial sets.
更多
查看译文
关键词
Randomness,K-trviality,cost functions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要