I am currently trying to prove whether the above language is decidable, partially decidable or fully undecidable. I am certain that this language is partially decidable and reducible to the halting problem. However, I am having trouble actually proving it.
Can anyone assist me with constructing the TM that decides this HALT variant?
What I'm thinking is creating a program that takes M and:
- if M terminates on w and tape is empty, accept
- if M terminates on w and tape is not empty, reject
- if M does not terminate on w, reject
