On the power of randomized multicounter machines

  • Hromkovi J
  • Schnitger G
  • 2


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


One-way two-counter machines represent a universal model of computation. Here we consider the polynomial-time classes of multicounter machines with a constant number of reversals and separate the computational power of nondeterminism, randomization and determinism. For instance, we show that polynomial-time one-way multicounter machines, with error probability tending to zero with growing input length, can recognize languages that cannot be accepted by polynomial-time nondeterministic two-way multicounter machines with a bounded number of reversals. A similar result holds for the comparison of determinism and one-sided-error randomization, and of determinism and Las Vegas randomization. © 2004 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Determinism
  • Multicounter machines
  • Nondeterminism
  • Problem complexity
  • Randomness

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Juraj Hromkovi

  • Georg Schnitger

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free