Computation with narrow CTCs

Authors:
A. C. Cem Say;Abuzer Yakaryilmaz
Affiliations:
Boğaziçi University, Department of Computer Engineering, Istanbul, Turkey;Boğaziçi University, Department of Computer Engineering, Istanbul, Turkey
Venue:
UC'11 Proceedings of the 10th international conference on Unconventional computation
Year:
2011

Citing 7
Cited 0

A lower bound for probabilistic algorithms for finite state machines

Journal of Computer and System Sciences
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
Pushdown automata with bounded nondeterminism and bounded ambiguity

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Two-way finite automata with quantum and classical states

Theoretical Computer Science - Natural computing
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science
The reduction of two-way automata to one-way automata

IBM Journal of Research and Development
Unbounded-error quantum computation with small space bounds

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.