in Theory of Computation
264 views
0 votes
0 votes
Consider the problem of determining whether a Turing machine $M$ on an input $w$ ever attempts to move its head left when its head is on the left-most tape cell. Formulate this problem as a language and show that it is undecidable.
in Theory of Computation
by
264 views

Please log in or register to answer this question.

Related questions