What computer science has to say about the simulation hypothesis

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns computers that simulate physical universes, which means that to formally investigate it we need to couple computer science theory with p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physic, complexity Ročník 6; číslo 4; s. 045010
Hlavní autor: Wolpert, David
Médium: Journal Article
Jazyk:angličtina
Vydáno: IOP Publishing 11.11.2025
Témata:
Church–Turing thesis
computer science theory
Rice’s theorem
simulation hypothesis
the recursion theorem
ISSN:2632-072X, 2632-072X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns computers that simulate physical universes, which means that to formally investigate it we need to couple computer science theory with physics. Here I couple those fields with the physical Church-Turing thesis. I then exploit that coupling to investigate some of the computer science theory aspects of the simulation hypothesis. In particular, I use Kleene’s second recursion theorem to prove that it is mathematically possible for us to be a simulation that is being run on a computer — by us. In such a self-simulation, there would be two identical instances of us; the question of which of those is “really us” is meaningless. I also show how Rice’s theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; and briefly investigate the graphical structure of universes simulating universes simulating universes . . ., among other issues. I end by describing some of the possible avenues for future research.
ISSN:2632-072X
2632-072X
DOI:10.1088/2632-072X/ae1e50