arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.00692cs.CCcs.LO
收藏

Kobayashi压缩系数

Kobayashi compressibility

George Barmpalias, Rodney G. Downey

摘要:

Kobayashi在相对图灵计算中引入了无限二进制序列的可压缩性的统一概念,并使用了oracle的子恒等式。Kobayashi可压缩性一直是一个相对模糊的概念,除了一些关于资源限制Kolmogorov复杂性的工作。这篇文章的主要目的是表明它与当前算法随机性研究中的一些主题有关。我们证明,小林压缩性可以用来定义马丁-勒夫随机性,一个强版本的有限随机性和库尔茨随机性,严格的图灵减少。此外,这些随机性概念自然对应图灵约简,弱真值表约简和真值表约简。最后,我们讨论了小林的主要结果,从他1981年的技术报告关于可计算可压缩集的压缩性,并提供额外的相关原始结果。

英文摘要:

Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the exception of some work on resource bounded Kolmogorov complexity. The main goal of this note is to show that it is relevant to a number of topics in current research on algorithmic randomness. We prove that Kobayashi compressibility can be used in order to define Martin-Loef randomness, a strong version of finite randomness and Kurtz randomness, strictly in terms of Turing reductions. Moreover these randomness notions naturally correspond to Turing reducibility, weak truth-table reducibility and truth-table reducibility respectively. Finally we discuss Kobayashi's main result from his 1981 technical report regarding the compressibility of computably enumerable sets, and provide additional related original results.

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

↑