A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Pushdown automata with bounded nondeterminism and bounded ambiguity
Theoretical Computer Science - Special issue: Latin American theoretical informatics
SIAM Journal on Computing
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
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The reduction of two-way automata to one-way automata
IBM Journal of Research and Development
On probabilistic pushdown automata
Information and Computation
Unbounded-error quantum computation with small space bounds
Information and Computation
| Hi-index | 0.00 |
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 decided by polynomial time probabilistic and quantum computers that can send a single classical bit to their own past. We show that, given a time machine with constant negative delay, one can implement CTC-based computations without the need to know about the runtime beforehand. Chaining multiple instances of such fixed-length CTCs, the power of postselection can be endowed to deterministic computers, all languages in $$\mathsf{NP} \cup \mathsf{coNP}$$ can be decided with no error in worst-case polynomial time, and all Turing-decidable languages can be decided in constant expected time. We provide proofs of the following facts for weaker models: Augmenting probabilistic computers with a single CTC leads to an improvement in language recognition power. Quantum computers under these restrictions are more powerful than their classical counterparts. Some deterministic models assisted with multiple CTCs are more powerful than those with a single CTC.