The machine can only write on the input word, not in empty cells. Prove that such modified Turing Machine is not equivalent to regular Turing Machine.
From my point of view, we should base on fact that number of configurations of this machine is finite, because input word (so different states of tape), alphabet, number of states are finite.
Lets suppose that this machine is equivalent to regular machine.
Here, we use following fact:
(*) Machine that rejects immediately if it visits the same configuration twice is equivalent to regular Turing Machine.
So, lets come back to our task: We assumed that this machine is equivalent so it is able to simulate some Turing machine. Lets simulate any Turing machine on this and we have a guaranty that this simulation is finite, because we use (*) and fact that number of states is finite. Hence we got contradiction because halt problem is undecidable.
What do you think about my solution ?
Using Hint's of answerer I try again:
I can use space hierarchy theorem. So, Lets suppose that such machine is equivalent to regular Turing Machine. Hence, each
decidable problem can be solved in linear space. $n^2$ is construable and $n\in O(n^2)$ so using space hierarchy theorem we conclude that there exists problem in class $DSPAC(n^2)$ which doesnt belgons to $DSPACE(n)$. It is contradiction, so we proved our thesis.
I think that my solution works. Each Modified Turing Machine either finish and reject/accept or get to the same state. Because we know that machine which reject always after enering to the same state is equivalent to regular Turing Machine. So our modified machine is able to decide Halt Problem.