What's the error in the following proof of the halting problem decidability?
A Turing machine may run forever without ever entering any kind of cycle. (Consider the machine which always just moves its head to the right.)