有效复杂性及其与逻辑深度的关系
Effective Complexity and its Relation to Logical Depth
摘要:
有效复杂性度量对象的语义信息含量。它是由M. Gell-Mann和S. Lloyd避免了Kolmogorov复杂性的一些缺点,也称为算法信息量。本文给出了有效复杂性的一个精确的形式化定义,并严格证明了它的基本性质。特别是,我们证明了不可压缩的二进制字符串是有效的简单,我们证明了字符串的存在,有效的复杂性接近其长度。此外,我们表明,有效的复杂性与贝内特的逻辑深度:如果字符串$x$的有效复杂性超过一定的明确的阈值,那么字符串必须有天文数字大的深度,否则,深度可以任意小。
英文摘要:
Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information content. In this paper, we give a precise formal definition of effective complexity and rigorous proofs of its basic properties. In particular, we show that incompressible binary strings are effectively simple, and we prove the existence of strings that have effective complexity close to their lengths. Furthermore, we show that effective complexity is related to Bennett's logical depth: If the effective complexity of a string $x$ exceeds a certain explicit threshold then that string must have astronomically large depth; otherwise, the depth can be arbitrarily small.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。