Arthur Nádas
IEEE Transactions on Neural Networks
The main result of this paper is that, given a Turing machine with several readwrite heads per tape, one can effectively construct an equivalent multitape Turing machine with a single read-write head per tape, which runs at precisely the same speed. This result implies that serial storage may be used to handle files requiring several points of immediate two-way read-write access without interruptions for rewinds, etc. It also yields simplified proofs of several results in the literature of computational complexity. © 1972, ACM. All rights reserved.
Arthur Nádas
IEEE Transactions on Neural Networks
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010