The paper presents a formal mathematical framework for analyzing the simulation hypothesis using concepts from computer science theory. Key insights:
The author defines what it means for one universe to "simulate" another, formalizing the notion of simulation. This allows rigorous analysis of the simulation hypothesis.
The author defines the Physical Church-Turing Thesis (PCT) and the Reverse Physical Church-Turing Thesis (RPCT), providing the first fully general formalizations of these concepts.
The author proves a "simulation lemma" showing that if a universe V obeys the RPCT, then it can simulate any universe V' that obeys the PCT.
Using Kleene's second recursion theorem, the author proves a "self-simulation lemma" - that a universe V which obeys both the PCT and RPCT can simulate itself, including containing instances of itself running simulations.
This self-simulation has deep philosophical implications, as it means there would be multiple identical instances of "you" in the simulation, and it is meaningless to ask which one is the "real you".
The author also discusses mathematical properties of self-simulation, such as the time complexity, as well as implications from Rice's theorem about the undecidability of certain questions related to simulation and self-simulation.
他の言語に翻訳
原文コンテンツから
arxiv.org
深掘り質問