一般空间上算法随机性的一致检验
Uniform test of algorithmic randomness over a general space
摘要:
当底层空间是有限或无限序列的集合,底层概率分布是均匀分布或可计算分布时,随机性的算法理论得到了很好的发展。这些限制似乎是人为的。在将理论扩展到任意伯努利分布(Martin-Loef)和任意分布(Levin)方面取得了一些进展。我们回顾了莱文理论的主要思想和问题,并在同一框架下报告进一步的进展。- 我们允许非紧空间(如布朗运动下的连续函数空间)。- 一致性检验(随机性不足)d_P(x)(既取决于结果x,又取决于测度P)应该以一种普遍而自然的方式定义。- 我们看到哪些旧的结果仍然存在:通用测试的存在性,随机性的守恒性,测试在描述复杂性方面的表达,通用度量的存在性,互信息作为“独立性不足”的表达。- 新的随机性测试的负面是一个概括的复杂性在连续空间中,我们发现,除了定理生存。本文的主要贡献是介绍了一个适当的框架,研究这些问题和相关的(如统计一般家庭的分布)。
英文摘要:
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Loef), and to arbitrary distributions (by Levin). We recall the main ideas and problems of Levin's theory, and report further progress in the same framework. - We allow non-compact spaces (like the space of continuous functions, underlying the Brownian motion). - The uniform test (deficiency of randomness) d_P(x) (depending both on the outcome x and the measure P should be defined in a general and natural way. - We see which of the old results survive: existence of universal tests, conservation of randomness, expression of tests in terms of description complexity, existence of a universal measure, expression of mutual information as "deficiency of independence. - The negative of the new randomness test is shown to be a generalization of complexity in continuous spaces; we show that the addition theorem survives. The paper's main contribution is introducing an appropriate framework for studying these questions and related ones (like statistics for a general family of distributions).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。