A non-erasing Turing machine is one that cannot replace a symbol with a blank unless the symbol under the read head is a blank. I'm trying to understand whether there is loss of generality because of this restriction.
My guess is that there is no loss of generality, because the restriction above merely restricts replacing characters with blanks, but we can just as easily replace them with some other symbol and construct any rules that might have used blanks to use the new symbol. I think that's too simple a solution though.
Can anyone give me any insight as to how to show whether or not generality is lost in the special case of non-erasing Turing machines?