限制复杂性重新审视[再一次]
Limit complexities revisited [once more]
摘要:
这篇文章的主要目的是把一些已知的结果在一个共同的角度,并简化其证明。我们开始一个简单的证明结果Vereshchagin说,$\limsup_n C(x|n)$等于$C^{0'}(x)$。然后,我们用同样的论证证明了前缀复杂度、二叉树上的先验概率的类似结果,证明了关于有效开集的极限的Conventional定理,并改进了Muchnik关于极限频率的结果。作为副产品,我们得到了Miller证明的2-随机性的一个判据:序列$X$是2-随机的当且仅当存在$c$使得$X$的任意前缀$x$是某个串$y$的前缀使得$C(y)\ge |y|-c$ . (In 20世纪60年代,Kolmogorov提出了这个属性,作为可能的随机性定义之一。我们还得到了Miller和Nies提出的另一个2-随机性准则:$X$是2-随机的当且仅当对某些$c$和$X$的无穷多个前缀$x$有$C(x)\ge |x|-c$.这是我们的旧论文的修改版本,其中包含了一个较弱(和繁琐)的版本Conventional '结果,证明使用了低基定理(在相当奇怪的方式)。完整的版本是作为一个猜想在那里制定的。这个猜想后来被康诺利证明了。Bruno Bauwens(个人通信)指出,证明也可以通过简单修改我们原来的论点来获得,我们在他的许可下复制Bauwens的论点。
英文摘要:
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the same argument to prove similar results for prefix complexity, a priori probability on binary tree, to prove Conidis' theorem about limits of effectively open sets, and also to improve the results of Muchnik about limit frequencies. As a by-product, we get a criterion of 2-randomness proved by Miller: a sequence $X$ is 2-random if and only if there exists $c$ such that any prefix $x$ of $X$ is a prefix of some string $y$ such that $C(y)\ge |y|-c$. (In the 1960ies this property was suggested in Kolmogorov as one of possible randomness definitions.) We also get another 2-randomness criterion by Miller and Nies: $X$ is 2-random if and only if $C(x)\ge |x|-c$ for some $c$ and infinitely many prefixes $x$ of $X$. This is a modified version of our old paper that contained a weaker (and cumbersome) version of Conidis' result, and the proof used low basis theorem (in quite a strange way). The full version was formulated there as a conjecture. This conjecture was later proved by Conidis. Bruno Bauwens (personal communication) noted that the proof can be obtained also by a simple modification of our original argument, and we reproduce Bauwens' argument with his permission.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。