组织复杂性与语义信息论的统一范式
A Unified Paradigm of Organized Complexity and Semantic Information Theory
摘要:
科学中最基本的问题之一是定量地定义{\it}有组织事物的复杂性,即,{\it有组织的复杂性}。虽然在过去的几十年里已经提出了许多措施来实现这一目标,但没有商定的定义。本文提出了一种新的组织复杂性的定量定义。这个定义{\it simultaneously}捕获了复杂性的三个主要特征:计算性(类似于逻辑深度)、分解性(类似于柯尔莫哥洛夫复杂性和有效复杂性)和分布性(类似于统计复杂性)。此外,所提出的定义是可计算的,可以以统一的方式测量对象的概率和确定性形式。提出的定义是基于电路,而不是图灵机和$ε$-机。我们给出了有组织的复杂性措施所需的几个标准,并表明,所提出的定义满足所有这些第一次。然后,我们应用这个定量的定义,制定了{\it语义信息论}。我们提出了第一个正式定义的{\it语义信息量},这是语义信息论的核心概念,这是只基于具体定义的概念。以前的语义信息论定义了这个量下的一些先验信息,这是没有具体规定。然后,我们揭示了语义信息论中的几个基本性质,例如,语义信源编码定理、语义信道编码定理和有效性编码定理。虽然语义信息论的研究已经有60多年的历史了,但是还没有关于语义信息论与组织复杂性之间关系的研究。本文首次提出了组织复杂性和语义信息论的统一范式。
英文摘要:
One of the most fundamental problems in science is to define {\it quantitatively} the complexity of organized matters, i.e., {\it organized complexity}. Although many measures have been proposed toward this aim in previous decades, there is no agreed upon definition. This paper presents a new quantitative definition of organized complexity. This definition {\it simultaneously} captures the three major features of complexity: computational (similar to logical depth), descriptional (similar to the Kolmogorov complexity and effective complexity) and distributional (similar to statistical complexity). In addition, the proposed definition is computable and can measure both probabilistic and deterministic forms of objects in a unified manner. The proposed definition is based on circuits rather than Turing machines and $ε$-machines. We give several criteria required for organized complexity measures and show that the proposed definition satisfies all of them for the first time. We then apply this quantitative definition to formulate a {\it semantic information theory}. We present the first formal definition of a {\it semantic information amount}, which is the core concept of the semantic information theory, that is based only on concretely defined notions. Previous semantic information theories defined this amount under some a priori information which is not concretely specified. We then unveil several fundamental properties in the semantic information theory, e.g., a semantic source coding theorem, semantic channel coding theorem, and effectiveness coding theorem. Although the semantic information theory has a long history of research going back more than six decades, there has been no study on its relation to organized complexity. This paper offers the first unified paradigm of organized complexity and semantic information theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。