✦ LIBER ✦

Halting space-bounded computations

✍ Scribed by Michael Sipser

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 378 KB
Volume: 10
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90053-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space-bounded hierarchies and probabilis

Space-bounded hierarchies and probabilistic computations

✍ Walter L. Ruzzo; Janos Simon; Martin Tompa 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 902 KB

Reversible simulation of space-bounded c

Reversible simulation of space-bounded computations

✍ Pierluigi Crescenzi; Christos H. Papadimitriou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Space bounded computations: review and n

Space bounded computations: review and new separation results

✍ Desh Ranjan; Richard Chang; Juris Hartmanis 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Tape-reversal bounded turing machine com

Tape-reversal bounded turing machine computations

✍ J. Hartmanis 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 667 KB

This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are inves

Halting State #01 - Halting State

✍ Charles Stross 📂 Fiction 📅 2011 🏛 Penguin 🌐 English ⚖ 215 KB 👁 3 views

Space-Bounded Quantum Complexity

✍ John Watrous 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 511 KB

This paper investigates the computational power of space-bounded quantum Turing machines. The following facts are proved for space-constructible space bounds s satisfying s(n)=0(log n): 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic Turin