Turing Machine M with a
wait option has the option to make the machine's head
wait where it is, until a case comes along where the
wait option is not used. I am trying to show that such a Turing machine recognizes the class of Turing recognizable languages.
I have been trying to brainstorm how to begin to show this, however, I am having a difficult time proving this for the 'class' of Turing recognizable languages, as it is so general.
I would appreciate if someone can give me some suggestions, as to how I should proceed with this proof.
Many thanks in advance!