An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and logarithmic space.

An oblivious I-tape Turing machine can simulate a multicounter machine on-line in linear time and logarithmic space. This leads to a linear cost ...

Oct 22, 2005 · An oblivious 1-tape Turing machine can on-line simulate a multicounter machine in linear time and logarithmic space.

An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and logarithmic space. This leads to a linear cost combinational ...

Jul 12, 1982 · The following simulations by machines equipped with a one-way input tape and additional queue storage are shown: Every nondeterministic ...

On Efficient Simulations of Multicounter Machines · P. Vitányi · Published in Information and Control 1 October 1982 · Computer Science, Mathematics.

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 ...

TL;DR: An oblivious 1-tape Turing machine can simulate a multicounter machine on-line in linear time and logarithmic space, which leads to a linear cost ...

On efficient simulations of multicounter machines. Paul M B Vitnyi. Show full list: 1 author. Publication type: Journal Article. Publication date: 1982-10-01.

An Augmented Counter Machine (ACM) is a multicounter machine, with ini- tially nonzero counters allowed, and the additional one-step instruction ''set.