论文标题
奎因是优胜灵程序：嵌套算法概率收敛到构造函数
Quines are the fittest programs: Nesting algorithmic probability converges to constructors
论文作者
论文摘要
在本文中，我们探讨了图灵机的程序和输出数据的多个元级层次结构应用的通用先验分布的限制行为。我们的动机是通过依次通过其描述编号编码的算法概率称量每个程序来减少所罗门诺夫假设的效果，即相同长度的所有可计算函数/假设同样可能。在限制情况下，我们将固定长度的所有可能程序字符串的集合转化为自我复制静脉和Quine-ray的分布 - 具有构造函数的结构。我们讨论实验算法信息理论如何为理解这项工作中提出的基本指标提供见解，并反思这些在构造者生活理论中的重要性。
In this article we explore the limiting behavior of the universal prior distribution applied over multiple meta-level hierarchy of program and output data of a Turing machine. We were motivated to reduce the effect of Solomonoff's assumption that all computable functions/hypothesis of the same length are equally likely, by weighing each program in turn by the algorithmic probability of their description number encoding. In the limiting case we converge the set of all possible program strings of a fixed-length to a distribution of self-replicating quines and quine-relays - having the structure of a constructor. We discuss how experimental algorithmic information theory provides insights towards understanding the fundamental metrics proposed in this work and reflect on the significance of these result in the constructor theory of life.
