Zusammenfassung
Zu jeder TuringmaschineM 1 mitk Arbeitsfeldern auf einemm-dimensionalen Speicher (m≥1) existiert eine TuringmaschineM 2 mit einem Band und einem Keller, diet M 1-Schritte in höchstens γt 2−1/mlg+γ′ Schritten simuliert. Diese Schranke ist höchstens um den Faktor lgt zu groß.
Summary
LetM 1 be a Turing machine withk heads on am-dimensional storage (m≥1). Then there exists a Turing machineM 2 with one tape and one stack, simulatingt M 1-steps in at most γt 2−1/mlgt+γ′M 2-steps. This result cannot be improved by more then a factor lgt.
This is a preview of subscription content, log in via an institution to check access.
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Literatur
Hennie, F. C.: On-Line Turing Machine Computations IEEE Trans. Electronic Computers EC-15,1, 35–44 (1966).
Hennie, F. C., andR. E. Stearns: Two-Tape Simulation of Multitape Turing Machines. J. Assoc. Comp. Mach.,13, 4, 533–546 (1966).
Stoss, H.-J.:k-Band Simulation vonk-Kopf Turingmaschinen. Erscheint in Computing.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Stoß, HJ. Zwei-Band Simulation von Turingmaschinen. Computing 7, 222–235 (1971). https://doi.org/10.1007/BF02242349
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02242349