arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.02081cs.CC
收藏

点计算和Martin-Löf随机性

Pointed computations and Martin-Löf randomness

George Barmpalias, Andrew Lewis-Pye, Angsheng Li

摘要:

Schnorr证明了一个实数是Martin-Loef随机的当且仅当它的所有初始段都是不可压缩的。Fortnow和独立尼斯,斯蒂芬和Terwijn注意到,这一声明仍然是正确的,如果我们可以只要求,初始部分的真正对应于一个可计算的增加序列的长度是不可压缩的。本说明的目的是对这一事实作出以下概括。本文证明了实数是X-Martin-Loef随机的当且仅当它的初始段对应于一个长度为X的可计算序列(r_n)(其中r_n可以自定界的方式从X计算,因此在计算中至多查询X的前r_n位)是不可压缩的。另一方面,我们还表明,有reals是非常远离马丁-洛夫随机,但他们计算的长度增加序列,在其初始段是不可压缩的。

英文摘要:

Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains true if we can merely require that the initial segments of the real corresponding to a computable increasing sequence of lengths are incompressible. The purpose of this note is to establish the following generalization of this fact. We show that a real is X Martin-Loef random if and only if its initial segments corresponding to a pointedly X-computable sequence (r_n) (where r_n is computable from X in a self-delimiting way, so that at most the first r_n bits of X are queried in the computation) of lengths are incompressible. On the other hand we also show that there are reals which are very far from being Martin-Loef random, yet they compute an increasing sequence of lengths at which their initial segments are incompressible.

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

↑