𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tape-reversal bounded turing machine computations

✍ Scribed by J. Hartmanis

Publisher
Elsevier Science
Year
1968
Tongue
English
Weight
667 KB
Volume
2
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis

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 investigated. The most striking difference between this and the previously studied complexity measures lies in the fact that the "speed-up" theorem does not hold for slowly growing tape-reversal complexity classes. These differences are discussed, and several relations between the different complexity measures and languages are established.

πŸ“œ SIMILAR VOLUMES

The reduction of tape reversals for off-
The reduction of tape reversals for off-line one-tape Turing machines
✍ Patrick C. Fischer πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 554 KB

For off-line one-tape Turing machines the number of tape reversals required for various computations may be uniformly reduced by an arbitrary constant factor. ## Introduction In the studies of specific measures of computational complexity it has always been of interest to determine the "speed-up"

Tape-bounded turing acceptors and princi
Tape-bounded turing acceptors and principal AFLs
✍ Ronald V. Book; Sheila A. Greibach; Oscar H. Ibarra; Ben Wegbreit πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 187 KB

Conditions are given under which the classes of formal languages defined by nondeterministic (deterministic) tape-bounded Turing acceptors will be principal AFLs. This paper is a sequel to the immediately preceding paper (see Ref. [1]). 1 To avoid unnecessary duplication, the terminology, notation,

Time- and tape-bounded turing acceptors
Time- and tape-bounded turing acceptors and AFLs
✍ Ronald V. Book; Sheila A. Greibach; Ben Wegbreit πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 763 KB

Complexity classes of formal languages defined by time-and tape-bounded Turing acceptors are studied. Sufficient conditions for these classes to be AFLs are given. Further, it is shown that a time-bounded nondeterministic Turing acceptor need have only two storage tapes.