2. Let M be the Turing machine shown, with alphabet ? = {0, 1} and tape alphabet
? = {0, 1, B}.
B/B, R
1/B, R
0/B, R
1/B, R
0/B, R
0/B, R
start
q?
q?
q?
B/B, R
q?
The Haltonw decision problem asks
Let w be an arbitrary string composed of 0s and 1s, which is an input for
M. Does M halt while processing the input w?
Determine whether the Haltonw decision problem is decidable or undecidable. If it
is decidable, then describe a terminating algorithm to decide it. If it is undecidable,
then prove that it is.