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

组装理论及其与计算复杂性的关系

Assembly Theory and its Relationship with Computational Complexity

Christopher P. Kempes, Michael Lachmann, Andrew Iannaccone, G. Matthew Fricke, M. Redwan Chowdhury, Sara I. Walker, Leroy Cronin

AI总结:

本文阐明组装理论以选择和物理测量解释复杂性,并通过数学示例与证明表明组装指数不同于 Shannon 熵、Huffman 编码和 LZW 等复杂性度量。

摘要:

组装理论(Assembly theory,AT)利用组装方程来量化选择,并基于两个测量量——组装指数和拷贝数——识别大量出现的复杂对象;其中,组装指数是从基本部件构造一个对象所需的最少连接操作数,而拷贝数是观测到的给定对象的实例数量。这两者共同定义了一个称为 Assembly 的量,它刻画了在观测样本中大量产生对象所需的因果量。这与对象的随机生成形成对比。在本文中,我们描述了 AT 如何将选择作为产生复杂性的机制,从而提供一种独特的进路,并回答与计算复杂性理论不同的问题;后者关注通过可压缩性获得的最短描述。为探究两种进路之间的形式差异,我们展示了若干简单而明确的数学例子,证明组装指数本身只是 AT 理论框架的一部分,在形式上并不等同于计算机科学和信息论中其他常用的复杂性度量,包括 Shannon 熵、Huffman 编码和 Lempel-Ziv-Welch 压缩。我们还给出证明,说明组装指数与这些压缩算法不属于同一计算复杂性类别,并讨论了 AT 在本体论基础上的根本差异,以及组装指数作为一种物理可观测量的性质;这些特征将其与脱离测量的生命形式化理论进路区分开来。

英文摘要:

Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assembly index is the minimum number of joining operations necessary to construct an object from basic parts, and the copy number is how many instances of the given object(s) are observed. Together these define a quantity, called Assembly, which captures the amount of causation required to produce objects in abundance in an observed sample. This contrasts with the random generation of objects. Herein we describe how AT's focus on selection as the mechanism for generating complexity offers a distinct approach, and answers different questions, than computational complexity theory with its focus on minimum descriptions via compressibility. To explore formal differences between the two approaches, we show several simple and explicit mathematical examples demonstrating that the assembly index, itself only one piece of the theoretical framework of AT, is formally not equivalent to other commonly used complexity measures from computer science and information theory including Shannon entropy, Huffman encoding, and Lempel-Ziv-Welch compression. We also include proofs that assembly index is not in the same computational complexity class as these compression algorithms and discuss fundamental differences in the ontological basis of AT, and assembly index as a physical observable, which distinguish it from theoretical approaches to formalizing life that are unmoored from measurement.

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

↑