范·兰巴根定理在某些可计算的测度下失效
Van Lambalgen's theorem fails for some computable measure
摘要:
范·兰巴尔根定理指出一对$(α,β)$是马丁-洛夫随机的当且仅当$α$是马丁-洛夫随机的,并且$β$相对于$α$是马丁-洛夫随机的。在[Information and Computation 209.2(2011):183-197,Theorem 3.3]中,Hayato Takahashi推广了van Lambalgen关于两个Cantor空间的乘积上的可计算测度$P$的定理;他证明了对于条件概率$P(\cdot | β)$是可计算的每个$β$,等价性成立。他问这个可计算性条件是否必要。我们给出了一个肯定的答案,提供了一个可计算的措施,其中范Lambalgen定理失败。我们还提出了一个简单的建设措施的条件措施是不可计算的。这种测度首先由N.阿克曼角Freer和D. Roy在[Proceedings of the 26 th Annual IEEE Symposium on Logic in Computer Science(LICS)]中,第26页。107-116. IEEE(2011)]。
英文摘要:
Van Lambalgen's theorem states that a pair $(α,β)$ of bitsequences is Martin-Löf random if and only if $α$ is Martin-Löf random and $β$ is Martin-Löf random relative to $α$. In [Information and Computation 209.2 (2011): 183-197, Theorem 3.3], Hayato Takahashi generalized van Lambalgen's theorem for computable measures $P$ on a product of two Cantor spaces; he showed that the equivalence holds for each $β$ for which the conditional probability $P(\cdot | β)$ is computable. He asked whether this computability condition is necessary. We give a positive answer by providing a computable measure for which van Lambalgen's theorem fails. We also present a simple construction of a measure for which conditional measure is not computable. Such measures were first constructed by N. Ackerman, C. Freer and D. Roy in [Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 107-116. IEEE (2011)].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。