paper

Computers with closed timelike curves can solve hard problems

arXiv:gr-qc/0209061 · doi:10.1023/A:1025967225931

Abstract

A computer which has access to a closed timelike curve, and can thereby send the results of calculations into its own past, can exploit this to solve difficult computational problems efficiently. I give a specific demonstration of this for the problem of factoring large numbers, and argue that a similar approach can solve NP-complete and PSPACE-complete problems. I discuss the potential impact of quantum effects on this result.

9 pages LaTeX; submitted to Foundations of Physics Letters

References in corpus (1)

Cited by in corpus (29)