$L=\{\langle M \rangle | M $is a Turing machine and $\exists$ input $x$ such that in $M(x)$ running $M$ moves its head left at least once $\}$
Is $L$ decidable?
$L=\{\langle M \rangle | M $is a Turing machine and $\exists$ input $x$ such that in $M(x)$ running $M$ moves its head left at least once $\}$
Is $L$ decidable?
Copyright © 2021 JogjaFile Inc.
Yes, make tree diagram of possible states and values being read $0,1$. If it moves left its in the set and you have your input. Continue the tree until all current values have occured before, if it hasnt gone left it never will since now it will just loop. The fact that it can write new entries is irrelevant since it cannot go back and read them.