论文标题
来自特殊相对论和不可证明的相对教会训练论文
A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability
论文作者
论文摘要
从图灵（Turing）于1950年的开创性作品开始，人工智能提出，图灵机可以模拟意识。这意味着宇宙是计算机上的模拟的所有事物的潜在理论，这引出了一个问题，即我们是否可以证明自己存在于模拟中。在这项工作中，我们构建了一个相对模型的计算模型，其中可计算\ textIt {local}计算机由经典的图灵计算机模拟。我们表明，其全局模拟器的本地计算机计算\ textbf {仿真属性}的问题与停止问题相同。然后，我们表明，全局模拟器累积的时间，空间或误差是模拟属性，因此是不可决定的。这些仿真属性在相对模型中产生了特殊的相对论效应，我们用来构建相对教会的 - 杜特奇（Deutsch）论文，其中全球，经典的图灵机器为本地机器计算量子力学，其本地机器具有与我们宇宙中经历相同的稳定局部计算复杂性。
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.
