论文标题

深度和成熟的相对论

Relativity of Depth and Sophistication

论文作者

Bédard, Charles Alexandre

论文摘要

逻辑深度和复杂性是对象非平凡组织的两个定量度量。尽管显然有所不同,但这些措施已被证明是等效的,当逻辑深度通过繁忙的海狸函数重新归一化时。在本文中,这些措施与辅助信息相关并彼此重复。辅助信息解决停止问题的能力引入了措施之间的失真。最后,类似于算法复杂性,复杂性和逻辑深度(重新归一化),每种都提供了其表达$(x,y)$,$(x)$和$(y | x)$之间的关系。

Logical depth and sophistication are two quantitative measures of the non-trivial organization of an object. Although apparently different, these measures have been proven equivalent, when the logical depth is renormalized by the busy beaver function. In this article, the measures are relativized to auxiliary information and re-compared to one another. The ability of auxiliary information to solve the halting problem introduces a distortion between the measures. Finally, similar to algorithmic complexity, sophistication and logical depth (renormalized) each offer a relation between their expression of $(x, y)$, $(x)$ and $(y | x)$.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源