Yes.
Can you provide a reference?
>> It seems self-evident that running forever can't be useful
Really? Do you not think that it might be useful for, say, an operating system to run forever?
It's nice when the OS has the option of shutting down deterministically.
So my point in saying that all useful programs halt was really to argue that all useful programs must have the constraint that they their behavior is always predictable, or controllable, in some sense. In a trivial way, computers are always predictable, but Turing proved that there are cases where it's impossible to predict the eventual outcome of a program in advance, i.e., the halting problem. In precise terms, the outcome (halt/not halt) of some programs is said to be undecidable or uncomputable. Undecidability is a hallmark of Turing machines. But since real programs are written by humans, who can't solve undecidable problems, real programs will never be able to gain any advantage from undecidable behavior.
Yes.
> It seems self-evident that running forever can't be useful
Really? Do you not think that it might be useful for, say, an operating system to run forever?