Efficient Computation by Three Counter Machines
Computational Complexity
2015-01-12 v1
Abstract
We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing machines in linear space.
Cite
@article{arxiv.1501.02212,
title = {Efficient Computation by Three Counter Machines},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1501.02212},
year = {2015}
}