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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
