Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following is FALSE with respect to possible outcomes of executing a Turing Machine over a given input?
1
It may halt and accept the input
2
It may halt by changing the input
3
It may halt and reject the input
4
It may never halt