Beginning with Turing's seminal work in 1950, artificial intelligence
proposes that consciousness can be simulated by a Turing machine. This implies
a potential theory of everything where the universe is a simulation on a
computer, which begs the question of whether we can prove we exist in a
simulation. In this work, we construct a relative model of computation where a
computable \textit{local} machine is simulated by a \textit{global}, classical
Turing machine. We show that the problem of the local machine computing
\textbf{simulation properties} of its global simulator is undecidable in the
same sense as the Halting problem. Then, we show that computing the time,
space, or error accumulated by the global simulator are simulation properties
and therefore are undecidable. These simulation properties give rise to special
relativistic effects in the relative model which we use to construct a relative
Church-Turing-Deutsch thesis where a global, classical Turing machine computes
quantum mechanics for a local machine with the same constant-time local
computational complexity as experienced in our universe.

通过构建一个相对的计算模型，我们证明了全局图灵机中局部计算机计算其全局模拟器的仿真属性是不可判定的，这些仿真属性引起了相对模型中的特殊相对论效应，我们利用这些性质构建了一个相对的 Church-Turing-Deutsch 论文。