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.
Registered at the Mathematical Centre as Report.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
FISCHER, M.J. & A.L. ROSENBERG, Real-time solutions of the origin-crossing problem, Math. Systems Theory 2 (1968), 257–264.
FISCHER, P.C., A.R. MEYER & A.L. ROSENBERG, Counter machines and counter languages, Math. Systems Theory 2 (1968), 265–283.
HARTMANIS, J. & R.E. STEARNS, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965), 285–306.
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.
MEAD, C.A. & L.A. CONWAY, Introduction to VLSI Systems, Addison-Wesley, NewYork, 1980.
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.
PIPPENGER, N. & M.J. FISCHER, Relations among complexity measures, Journal ACM, 26 (1979), 361–384.
ROSENBERG, A.L., Real-time definable languages, Journal ACM 14 (1967), 645–662.
SCHNORR, C.P., The network complexity and Turing machine complexity of finite functions, Acta Informatica 7, (1976), 95–107
VITÁNYI, P.M.B., Relativized Obliviousness, in Lecture Notes in Computer Science 88 (1980), 665–672, Springer Verlag, New York. (Proc. MFCS '80).
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vitártyi, P.M.B. (1982). Efficient simulations of multicounter machines. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012799
Download citation
DOI: https://doi.org/10.1007/BFb0012799
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive