Abstract
Every single-tape deterministic Turing machine (DTM) of time complexity T(n)≥n2 can be simulated by a single-tape DTM in space T1/2(n). It is shown that the time of the simulation can be bounded by T3/2(n). Similar results are shown for offline machines and for machines with multidimensional tape.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have