arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.04530cs.ITmath.IT
收藏

关于某些对象中的信息内容

On information content in certain objects

Nikolay Vereshchagin

AI总结:

本文研究自然对象的普通条件复杂度与全条件复杂度之间的差距,首次证明复杂度小于 n 的字符串数量与字典序第一个高复杂度字符串之间的相互全条件复杂度可能很大。

摘要:

度量信息依赖性的精细方法基于全条件复杂度 CT(y|x),其定义为在输入 x 上输出 y 的全程序的最小长度。已知全条件复杂度可能远大于普通条件复杂度。这样的字符串 x、y 通过对角线论证来定义,除此之外并无其他有趣之处。本文研究这种情况是否也会出现在某些自然对象上。更具体地说,我们考虑以下对象:复杂度小于 n 的字符串的数量,以及长度为 n 且复杂度至少为 n 的字典序第一个字符串。已知它们具有可忽略的相互条件复杂度。本文证明它们的相互全条件复杂度可能很大。这是普通条件复杂度远小于全条件复杂度的自然对象的第一个例子。

英文摘要:

The fine approach to measure information dependence is based on the total conditional complexity CT(y|x), which is defined as the minimal length of a total program that outputs y on the input x. It is known that the total conditional complexity can be much larger than than the plain conditional complexity. Such strings x, y are defined by means of a diagonal argument and are not otherwise interesting. In this paper we investigate whether this happens also for some natural objects. More specifically, we consider the following objects: the number of strings of complexity less than n and the lex first string of length n and complexity at least n. It is known that they have negligible mutual conditional complexities. In this paper we prove that their mutual total conditional complexities may be large. This is the first example of natural objects whose plain conditional complexity is much less than the total one.

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

↑