Showing papers by "Jan van Leeuwen published in 1988"
TL;DR: It is proved that a T, S and U Turing machine can be simulated in time by a random access machine (with no multiplication or division instructions) under the logarithmic cost criterion.
Abstract: We prove that a $T(n)$ time-bounded, $S(n)$ space-bounded and $U(n)$ output-length-bounded Turing machine can be simulated in $O(T(n) + (n + U(n))\log \log S(n))$ time by a random access machine (with no multiplication or division instructions) under the logarithmic cost criterion.
20 citations
15 Jun 1988
7 citations
TL;DR: It is argued that ‘smoothness’ of f, i.e., f(O(n))=O(f(n)), does not play a role in estimating [f](n), contrary to the suggestion in some references.