On the power of real-time turing machines under varying specifications

  • Paul M. B. Vitányi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


We investigate the relative computing power of Turing machines with differences in the number of work tapes, heads pro work tape, instruction repertoire etc. We concentrate on the k-tape, k-head and k-head jump models as well as the 2-way multihead finite automata with and without jumps. Differences in computing power between machines of unlike specifications emerge under the real-time restriction. In particular it is shown that k+1 heads are more powerful than k heads for real-time Turing machines.


Turing Machine Finite Automaton Closure Property Input Tape Marked Concatenation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AANDERAA, S.O. (1974), On k-tape versus (k-1)-tape real time computation, SIAM AMS Proceedings, Vol. 7 (Complexity of Computation), 75–96.Google Scholar
  2. FISCHER, M.J. & A.L. ROSENBERG (1968), Limited random access Turing machines, Proceedings 9-th IEEE-SWAT, 356–367.Google Scholar
  3. FISCHER, P.C., A.R. MEYER & A.L. ROSENBERG (1972), Real-time simulation of multihead tape units, JACM 19, 590–607.Google Scholar
  4. GALIL, Z. (1978), Palindrome recognition in real time on a multitape Turing machine, J. Comp. Syst. Sci. 16, 140–157.Google Scholar
  5. HARTMANIS, J. & R.E. STEARNS (1965), On the computational complexity of algorithms, Trans. AMS 117, 285–306.Google Scholar
  6. JANIGA, L. (1979), Real-time computations of two-way multihead finite automata, in: Fundamentals of Computation Theory (FCT '79) (L. Budach ed.), Akademie Verlag, Berlin, 214–218.Google Scholar
  7. KOSARAJU, R. (1979), Real-time simulation of concatenable double-ended queues by double-ended queues, Proceedings 11-th ACM-STOC, 346–351.Google Scholar
  8. LEONG, B. & J. SEIFERAS (1977), New real-time simulations of multihead tape units, Proceedings 9-th ACM-STOC, 239–248.Google Scholar
  9. RABIN, M.O. (1963), Real-time computation, Israel Journal of Mathematics 1, 203–211.Google Scholar
  10. ROSENBERG, A.L. (1967), Real-time definable languages, J. ACM 14, 645–662.Google Scholar
  11. SAVITCH, W.J. & P.M.B. VITÁNYI (1977), Linear time simulation of multihead Turing machines with head-to-head jumps, Lecture Notes in Computer Science (ICALP 4) 52, Springer-Verlag, Berlin, 453–464.Google Scholar
  12. VITANYI, P.M.B. (1979), Multihead and multitape real-time Turing machines. Technical Report IW 111, Mathematisch Centrum, June 1979.Google Scholar
  13. YAO, A. & R. RIVEST (1978), k+1 heads are better than k, J. ACM 25, 337–340.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Paul M. B. Vitányi
    • 1
  1. 1.Mathematisch CentrumAmsterdamThe Netherlands

Personalised recommendations