arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.05082math.LO
收藏

什么时候随机性来自随机性?

When does randomness come from randomness?

Jason Rute

摘要:

沈的一个结果说,如果$F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$是几乎处处可计算的,保测变换,并且$y\in2^{\mathbb{N}}$是Martin-Löf随机的,则存在Martin-Löf随机$x\in2^{\mathbb{N}}$使得$F(x)=y$。通过讨论Bienvenu和Porter的一个问题,我们证明了这个性质适用于可计算的随机性,但不适用于Schnorr随机性。这些结果,结合其他已知的结果,意味着马丁-洛夫随机集是$2^{\mathbb{N}}$的最大子集满足这个性质,也满足随机性保持:如果$F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$是几乎处处可计算的,测度保持映射,如果$x\in2^{\mathbb{N}}$是随机的,那么$F(x)$是随机的。

英文摘要:

A result of Shen says that if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving transformation, and $y\in2^{\mathbb{N}}$ is Martin-Löf random, then there is a Martin-Löf random $x\in2^{\mathbb{N}}$ such that $F(x)=y$. Answering a question of Bienvenu and Porter, we show that this property holds for computable randomness, but not Schnorr randomness. These results, combined with other known results, imply that the set of Martin-Löf randoms is the largest subset of $2^{\mathbb{N}}$ satisfying this property and also satisfying randomness preservation: if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving map, and if $x\in2^{\mathbb{N}}$ is random, then $F(x)$ is random.

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

↑