Abstract
We shall show that, for each nondeterministic single-tape Turing machine M of time complexity T( n)⩾ n 2 and each K⩾1, there exists and equivalent K times faster nondeterministic Turing machine M′ writing only zeroes and ones on its tape. In other words, we can obtain the linear speed-up while preserving the binary worktape alphabet. Therefore, nondeterministic single-tape Turing machines do not require tape compression for speeding up.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
