arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.2178gr-qc
收藏

计算人择原理:多重宇宙中最难的问题在哪里?

A Computational Anthropic Principle: Where is the Hardest Problem in the Multiverse?

Navin Sivanandam

摘要:

人择原理是对可能理论空间的一个不可避免的限制。因此,它是确定物理学极限的核心。特别是,我们认为,物理学中最终可能的东西是由宇宙计算能力的限制决定的,而观测者更有可能在更复杂的计算是可能的地方找到。我们的讨论涵盖了理论偏见的不可避免性,以及人类学和计算如何以系统的方式帮助将这些偏见强加给理论景观。此外,我们主张(尽可能)自上而下,而不是自下而上的人为措施,认为后者往往是误导。我们开始建设一个明确的计算措施,通过检查的影响,宇宙学常数在一个给定的宇宙中的计算界限,从以前的工作中使用熵生产作为代理观察者的布索,哈尼克,Krribs和佩雷斯。此外,我们强调了一些额外的计算考虑,可用于扩展这样的措施。

英文摘要:

The anthropic principle is an inevitable constraint on the space of possible theories. As such it is central to determining the limits of physics. In particular, we contend that what is ultimately possible in physics is determined by restrictions on the computational capacity of the universe, and that observers are more likely to be found where more complicated calculations are possible. Our discussion covers the inevitability of theoretical bias and how anthropics and computation can be an aid to imposing these biases on the theory landscape in a systematic way. Further, we argue for (as far as possible) top-down rather than bottom-up anthropic measures, contending that that the latter can often be misleading. We begin the construction of an explicit computational measure by examining the effect of the cosmological constant on computational bounds in a given universe, drawing from previous work on using entropy production as a proxy for observers by Bousso, Harnik, Kribs and Perez. In addition, we highlight a few of the additional computational considerations that may be used to extend such a measure.

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

↑