随机预言机通过有限下注策略的计算冗余的下界
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
摘要:
库切拉-加奇定理是算法随机性的一个里程碑式的结果,它断言每个实数都可以从马丁-洛夫随机实数计算出来。如果序列的前$n$位的计算需要随机预言的$n+h(n)$位,则$h$是计算的冗余。Kučera隐式地实现了冗余$n\log n$,而Gács使用了更精细的编码过程来实现冗余$\sqrt{n}\log n$。一个类似的上界隐含在Merkle和Mihailović后来的证明中。在本文中,我们得到严格的最佳下界的计算中的冗余Martin-Löf随机神谕。我们证明了任何非减可计算函数$g$,使得$\sum_n 2^{-g(n)}=\infty$不是Martin-Löf随机预言机计算中冗余度的一般上界。事实上,存在一个真实的$X$,使得从Martin-Löf随机预言机进行的任何$X$计算的冗余$g$满足$\sum_n 2^{-g(n)}<\infty$。此外,这类实是comeager的,它包含一个$Δ^0_2$实以及所有弱2-类属实。这排除了许多增长缓慢的函数,如$\log n$,使其无法限制大量实数的随机预言机的计算冗余。另一方面,最近证明,如果$\sum_n 2^{-g(n)}<\infty$,则$g$是从某个Martin-Löf随机预言计算任何实数的冗余的一般上界。我们的研究结果是作为一个理论的有效投注策略,我们开发的限制赌注的应用。
英文摘要:
The Kučera-Gács theorem is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-Löf random real. If the computation of the first $n$ bits of a sequence requires $n+h(n)$ bits of the random oracle, then $h$ is the redundancy of the computation. Kučera implicitly achieved redundancy $n\log n$ while Gács used a more elaborate coding procedure which achieves redundancy $\sqrt{n}\log n$. A similar upper bound is implicit in the later proof by Merkle and Mihailović. In this paper we obtain strict optimal lower bounds on the redundancy in computations from Martin-Löf random oracles. We show that any nondecreasing computable function $g$ such that $\sum_n 2^{-g(n)}=\infty$ is not a general upper bound on the redundancy in computations from Martin-Löf random oracles. In fact, there exists a real $X$ such that the redundancy $g$ of any computation of $X$ from a Martin-Löf random oracle satisfies $\sum_n 2^{-g(n)}<\infty$. Moreover, the class of such reals is comeager and includes a $Δ^0_2$ real as well as all weakly 2-generic reals. This excludes many slow growing functions such as $\log n$ from bounding the redundancy in computations from random oracles for a large class of reals. On the other hand it was recently shown that if $\sum_n 2^{-g(n)}<\infty$ then $g$ is a general upper bound for the redundancy in computations of any real from some Martin-Löf random oracle. Our results are obtained as an application of a theory of effective betting strategies with restricted wagers which we develop.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。