@MISC{Vitányi_ontwo-tape, author = {Paul M.B. Vitányi}, title = {On Two-Tape Real-Time Computation and Queues}, year = {} }
Bookmark
OpenURL
Abstract
This is a draft version of [J. Computer and System Sciences, 29 (1984) 303 - 311]. A Turing machine with two storage tapes can not simulate a queue in both real-time and with at least one storage tape head always within o (n) squares from the start square. This fact may be useful for showing that a two-head tape unit is more powerful in real-time than two one-head tape units, as is commonly conjectured. Keywords & Phrases: multitape Turing machine, multihead Turing machine, real-time computation, two heads versus two tapes, storage retrieval, queue, incompressible string, Kolmogorov complexity Proposed Running Head: TWO-TAPE REAL-TIME COMPUTATION ################## * This work was supported by the Stichting Mathematisch Centrum. -- -- - 2 - 1. Introduction. Real-time computation in the world of Turing machine like devices is the analogon to real-time computation in concrete computer systems. To compare the relative computation power of two storage devices a fine distinction can be...