1 1 vote Consider the problem of determining whether a two-tape Turing machine ever writes a nonblank symbol on its second tape when it is run on input $w$. Formulate this problem as a language and show that it is undecidable. Theory of Computation michael-sipser theory-of-computation turing-machine decidability proof + – admin 468 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
