Question

A language $L$ is said to be Turing machine (TM) decidable if

• A. TM decides L
• B. TM recognizes L
• C. TM accepts L
• D. L is recursive and TM recognize L

Hint:

TM-decidable = recursive languages. TM must halt on all inputs.

Answer 1

The Correct Option is D

A language is TM-decidable (i.e., recursive) if there exists a TM that halts on every input and correctly accepts or rejects.