复杂性vs逻辑深度
Sophistication vs Logical Depth
摘要:
复杂度和逻辑深度是表示字符串结构复杂程度的两个度量。复杂度被定义为可计算函数的最小复杂度,该函数定义了在某个精度内最短的字符串的两部分描述;第二部分可以定义为在某个精度内最短的程序的最小计算时间。我们表明,忙碌的海狸功能的复杂性的字符串超过其逻辑深度与更大的精度,和逻辑深度超过忙碌的海狸功能的复杂性与更大的精度。我们还表明,这是不正确的,如果精度只增加了一个常数(当这些概念定义与平原Kolmogorov复杂性)。最后,我们表明,复杂性是不稳定的,其精度:恒定的变化可以改变其值的长度的一个线性项的字符串。
英文摘要:
Sophistication and logical depth are two measures that express how complicated the structure in a string is. Sophistication is defined as the minimal complexity of a computable function that defines a two-part description for the string that is shortest within some precision; the second can be defined as the minimal computation time of a program that is shortest within some precision. We show that the Busy Beaver function of the sophistication of a string exceeds its logical depth with logarithmically bigger precision, and that logical depth exceeds the Busy Beaver function of sophistication with logarithmically bigger precision. We also show that this is not true if the precision is only increased by a constant (when the notions are defined with plain Kolmogorov complexity). Finally we show that sophistication is unstable in its precision: constant variations can change its value by a linear term in the length of the string.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。