Title :
Limited random access turing machines
Author :
Fischer, Michael J. ; Rosenberg, Arnold L.
Abstract :
The model of an online multitape Turing machine is generalized by adding a bounded number of repositioning operations to the shift repertoire. It is proved that any such limited random access Turing machine can be effectively replaced by an equivalent conventional Turing machine which operates in the same time. This result yields simplified proofs and extensions of several results in the literature.
Keywords :
Automata; Computational complexity; Counting circuits; Magnetic heads; Magnetic resonance; Mathematical model; Timing; Turing machines;
Conference_Titel :
Switching and Automata Theory, 1968., IEEE Conference Record of 9th Annual Symposium on
Conference_Location :
Schenedtady, NY, USA
DOI :
10.1109/SWAT.1968.15
