Abstract
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of the classes of languages recognized by polynomial time probabilistic and quantum computers that can send a single classical bit to their own past. Such narrow CTCs are demonstrated to add the power of limited nondeterminism to deterministic computers, and lead to exponential speedup in constant-space probabilistic and quantum computation. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Say, A. C. C., & YakaryIlmaz, A. (2011). Computation with narrow CTCs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6714 LNCS, pp. 201–211). https://doi.org/10.1007/978-3-642-21341-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
