平稳过程实现的有效复杂度
Effective complexity of stationary process realizations
摘要:
Gell-Mann和Lloyd提出了对象的有效复杂性概念,即对象的最小描述长度。该模型是通过合奏,即概率分布在有限的二进制字符串。在我们以前的论文中,我们提出了一个精确的算法信息论的有效复杂性的定义。在这里,我们调查的有效复杂性的二进制字符串产生的固定,一般不计算,过程。我们表明,在不太强的条件下,长的典型过程实现是有效的简单。我们的结果在粗糙有效复杂度的上下文中变得最透明,粗糙有效复杂度是对有效复杂度的原始概念的修改,在其定义中使用较少的参数。Antunes和Fortnow也对相关的复杂性概念提出了类似的修改。
英文摘要:
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by means of ensembles, that is probability distributions on finite binary strings. In our previous paper we propose a definition of effective complexity in precise terms of algorithmic information theory. Here we investigate the effective complexity of binary strings generated by stationary, in general not computable, processes. We show that under not too strong conditions long typical process realizations are effectively simple. Our results become most transparent in the context of coarse effective complexity which is a modification of the original notion of effective complexity that uses less parameters in its definition. A similar modification of the related concept of sophistication has been suggested by Antunes and Fortnow.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。