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.