Deterministic simulation of a single tape Turing machine by a Random Access Machine in sub-linear time

https://doi.org/10.1016/0890-5401(92)90026-CGet rights and content
Under an Elsevier user license
open archive

Abstract

The class of functions computed within any time bound greater than nlog logn by a single tape Turing machine is strictly contained within the class of functions computed by a Random Access Machine in the same time according to the logarithmic cost criterion.

Cited by (0)