Turing Machines Equipped with CTC in Physical Universes
Sara Babaee Khanehsar, Farzad Didehvar

TL;DR
This paper examines the physical plausibility of Turing machines with closed time-like curves (CTCs), proposing axioms to ensure consistency and analyzing their implications for computation and information transfer.
Contribution
It introduces strong and weak axioms for CTCs, discusses their physical implications, and proposes the data transferring hypothesis to address computational limitations.
Findings
CTCs imply the destruction of particles before completing a full loop.
Under the weak axiom, Turing machines cannot transmit information around CTCs.
The data transferring hypothesis offers a potential solution for information transfer in CTC-containing universes.
Abstract
We study the paradoxical aspects of closed time-like curves and their impact on the theory of computation. After introducing the , a classical Turing machine benefiting CTCs for backward time travel, Aaronson et al. proved that and the sets, such as the halting problem, are computable within this computational model. Our critical view is the physical consistency of this model, which leads to proposing the strong axiom, explaining that every particle rounding on a CTC will be destroyed before returning to its starting time, and the weak axiom, describing the same notion, particularly for Turing machines. We claim that in a universe containing CTCs, the two axioms must be true; otherwise, there will be an infinite number of any particle rounding on a CTC in the universe. An immediate result of the weak axiom is the incapability…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Complexity and Algorithms in Graphs · semigroups and automata theory
