Question: [46] Prove that simulating a linear-time 2-tape deterministic Turing machine with one-way input by a 1-tape nondeterministic Turing machine with one-way input requires (n2/ log(k)

[46] Prove that simulating a linear-time 2-tape deterministic Turing machine with one-way input by a 1-tape nondeterministic Turing machine with one-way input requires Ω(n2/ log(k) n) time, for any k, where log(k) = log log ··· log is the k-fold iterated logarithm. This improves the result in Exercise 6.10.4.

Comments. Source: [Z. Galil, R. Kannan, and E. Szemer´edi, J. Comput.

System Sci., 38(1989), 134–149; Combinatorica, 9(1989), 9–19].

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Elementary Probability For Applications Questions!