DeepAI AI Chat
Log In Sign Up

A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability

by   Blake Wilson, et al.
Purdue University

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 local machine is simulated by a global, classical Turing machine. We show that the problem of the local machine computing 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.


page 1

page 2

page 3

page 4


Turing Machines cannot simulate the human mind

Can a Turing Machine simulate the human mind? If the Church-Turing thesi...

Space-bounded Church-Turing thesis and computational tractability of closed systems

We report a new limitation on the ability of physical systems to perform...

The Rise and Fall of the Church-Turing Thesis

The essay consists of three parts. In the first part, it is explained ho...

A Distributed Extension of the Turing Machine

The Turing Machine has two implicit properties that depend on its underl...

The Machine as Data: A Computational View of Emergence and Definability

Turing's (1936) paper on computable numbers has played its role in under...

Quantum Random Self-Modifiable Computation

Among the fundamental questions in computer science, at least two have a...

Means-fit effectivity

Historically, the notion of effective algorithm is closely related to th...