A language is Turing-decidable if there exists a Turing machine that always accepts strings in the language, rejects strings that are not in the language, but never loops.
Why is this statement false? "never loops" should be "neven infinitely loops"?
