Abstract
In this paper, we prove that a k-tape Minsky machine operating with time $$T(n)$$ can be modeled by a three-tape Minsky machine in a time not exceeding $$T{{(n)}^{k}} \times \log T(n)$$ . It is shown that multitape Turing machines can be modeled by three-tape Minsky machines with optimal word encoding.
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.
