0
$\begingroup$

Sorry, I think I misunderstand the question, It should read as if $L$ is turing-recognizable but not decidable, then there exists infinitely many input that any TM will not halt on it...

$\endgroup$
0
$\begingroup$

The question shows several misconceptions. I'll try to clarify the key aspects.

If $L$ is recognizable but not decidable, then $L$ has to be infinite (otherwise, it is decidable). If a TM recognizes such $L$, it has to accept all the words in $L$ (by definition of "recognizes"), hence it must halt in infinitely many cases.

A TM halting on infinitely many cases does not imply that the recognized language is decidable. (I'm unsure about why you think this would be the case, it would make the halting problem decidable, for instance.)

There is no such a thing as an uncountable language, at least in a conventional setting where the alphabet is countable, and words have finite length. Hence, a TM can never halt on "uncountably many" words.

$\endgroup$
  • $\begingroup$ Okay, thank you for your clarification, let me rephrase it, I want to show that such a Turing Machine will fail to halt, if there are infinitely many inputs $\endgroup$ – Joe Nov 12 at 2:14
  • $\begingroup$ @Joe That machine will fail to halt on infinitely many inputs, otherwise (if it diverges only on finitely many cases), one could modify the TM on those finitely many cases so that it halts and rejects them and craft a TM that decides $L$, which is impossible. $\endgroup$ – chi Nov 12 at 8:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.