The reduction of tape reversals for off-
β
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"