Abstract
In 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes and time complexity T can be simulated by an alternating Turing machine with linear tapes that runs in time O( T log T ) . We extend their result to multidimensional Turing machines. We show that every deterministic Turing machine with d-dimensional tapes and time complexity T can be simulated by an alternating Turing machine with linear tapes that runs in time O( T ( log T) 1 d )
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.
