Computation in Nested Closed Timelike Curves
Publication date
Authors
DOI
Document Type
Master Thesis
Metadata
Show full item recordCollections
License
CC-BY-NC-ND
Abstract
How powerful computers are depends on the laws of physics that govern the behaviour of a computer. So to determine what problems can be solved by computers, we have to consider the physical model they are present in. In general relativity theory, spacetime can curve so much that loops are formed, potentially allowing travel back in time. It might even be possible for there to be loops within other loops. By considering these loops quantum mechanically, a consistent physical model can be formulated. This thesis investigates what computational problems can be solved by computers with access to such loops. I show that more and more problems that are impossible to solve on our current computers, can be solved as the computer gets access to more and more of such loops.
Keywords
computation;computability;computer science;time travel;time loops;ctc;ctcs;closed timelike curves;closed timelike lines;nested;nesting;complexity;computational computability;aaronson;gueltrini;bavarian;general relativity;quantum mechanics;quantum computing;relativistic computing;physical computation;foundations of computer science;philosophy of computing;philosophy of physics;algorithms;turing;deutsch