2 research outputs found
An Improved Simulation Result for Ink Bounded Turing Machines
A (one tape, deterministic) Turing machine is ink bounded if the machine changes a symbol of its work tape at most times while processing any input of length . The main result of our paper is the construction of an "ink efficient" universal machine which, for any ink bounded machine and input , can simulate the processing of on or detect that is looping infinitely on input . The universal machine requires O(f(n)^{1+\epsilon) ink for this simulation where is an arbitrarily small positive number. As a corollary, we establish that the class of all ink bounded computations is properly contained in the class of all ink bounded computations assuming and a technical condition on g