arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0608095cs.ITcs.CCmath.ITmath.PR
收藏

平稳概率

Stationary Algorithmic Probability

Markus Mueller

摘要:

Kolmogorov复杂度和算法概率仅定义为可加性。乘法常数,因为它们的实际值取决于通用参考计算机的选择。在本文中,我们分析了一种自然的方法来消除这种机器依赖。我们的方法是将算法概率分配给不同的计算机本身,基于“非自然”计算机应该很难模仿的想法。因此,我们研究通用计算机随机相互仿真的马尔可夫过程。相应的平稳分布,如果存在的话,将在计算机上和二进制字符串上给出一个自然的、与机器无关的概率测度。不幸的是,我们表明,没有固定的分布存在于所有计算机的集合,因此,这种方法不能消除机器依赖。此外,我们证明了失败的原因有一个明确而有趣的物理解释,这表明,任何其他可以想象的试图摆脱这些附加常数的尝试在原则上也必须失败。然而,我们表明,限制到某些子类的计算机可能有助于摆脱一定数量的机器依赖在某些情况下,和由此产生的固定的计算机和字符串概率有美丽的属性。

英文摘要:

Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural approach to eliminate this machine-dependence. Our method is to assign algorithmic probabilities to the different computers themselves, based on the idea that "unnatural" computers should be hard to emulate. Therefore, we study the Markov process of universal computers randomly emulating each other. The corresponding stationary distribution, if it existed, would give a natural and machine-independent probability measure on the computers, and also on the binary strings. Unfortunately, we show that no stationary distribution exists on the set of all computers; thus, this method cannot eliminate machine-dependence. Moreover, we show that the reason for failure has a clear and interesting physical interpretation, suggesting that every other conceivable attempt to get rid of those additive constants must fail in principle, too. However, we show that restricting to some subclass of computers might help to get rid of some amount of machine-dependence in some situations, and the resulting stationary computer and string probabilities have beautiful properties.

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

↑