Advertisement

Efficient simulations of multicounter machines

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

Abstract

An oblivious 1-tape Turing machine can on-line simulate a multicounter machine in linear time and logarithmic space. This leads to a linear cost combinational logic network implementing the first n steps of a multicounter machine and also to a linear time/logarithmic space on-line simulation by an oblivious logarithmic cost RAM. An oblivious log *n-head tape unit can simulate the first n steps of a multicounter machine in real-time, which leads to a linear cost combinational logic network with a constant data rate.

Keywords

Turing Machine Input Port Logic Network Simulation Cycle Proof Sketch 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    FISCHER, M.J. & A.L. ROSENBERG, Real-time solutions of the origin-crossing problem, Math. Systems Theory 2 (1968), 257–264.MathSciNetCrossRefGoogle Scholar
  2. [2]
    FISCHER, P.C., A.R. MEYER & A.L. ROSENBERG, Counter machines and counter languages, Math. Systems Theory 2 (1968), 265–283.MathSciNetCrossRefGoogle Scholar
  3. [3]
    HARTMANIS, J. & R.E. STEARNS, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965), 285–306.MathSciNetCrossRefGoogle Scholar
  4. [4]
    MINSKY, M., Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines, Ann. of Math. 74 (1961), 437–455.MathSciNetCrossRefGoogle Scholar
  5. [5]
    MEAD, C.A. & L.A. CONWAY, Introduction to VLSI Systems, Addison-Wesley, NewYork, 1980.Google Scholar
  6. [6]
    PATERSON, M.S., M.J. FISCHER & A.R. MEYER, An improved overlap argument for online multiplication, SIAM-AMS Proceedings, Vol. 7, (Complexity of Computation) 1974, 97–112.zbMATHGoogle Scholar
  7. [7]
    PIPPENGER, N. & M.J. FISCHER, Relations among complexity measures, Journal ACM, 26 (1979), 361–384.MathSciNetCrossRefGoogle Scholar
  8. [8]
    ROSENBERG, A.L., Real-time definable languages, Journal ACM 14 (1967), 645–662.MathSciNetCrossRefGoogle Scholar
  9. [9]
    SCHNORR, C.P., The network complexity and Turing machine complexity of finite functions, Acta Informatica 7, (1976), 95–107MathSciNetCrossRefGoogle Scholar
  10. [10]
    VITÁNYI, P.M.B., Relativized Obliviousness, in Lecture Notes in Computer Science 88 (1980), 665–672, Springer Verlag, New York. (Proc. MFCS '80).Google Scholar
  11. [11]
    VITáNYI, P.M.B., Real-time simulation of multicounters by oblivious one-tape Turing machines, Proceedings 14th ACM Symp. on Theory of Computing, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Paul M. B. Vitártyi
    • 1
  1. 1.Mathematisch CentrumSJ AmsterdamThe Netherlands

Personalised recommendations