Abstract
By making use of the programming technique developed in [1], we shall study a problem whether a given real-time Turing machine with k work-tapes is simulatable by a modified Schepherdson-Sturgis' machine or not, and give an affirmative solution of the question by constructing a simulation program in such a machine.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
Disclaimer: 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.