2000 character limit reached
Efficient Computation by Three Counter Machines (1501.02212v1)
Published 9 Jan 2015 in cs.CC
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.