For a statement L ⊆ Σ∗ A language is recursive if there exists M some turing machine . Which of the following conditions is satisfied for ω any string ? ω ∈ L M ω M

1. AIf , then accepts and will not halt ω ∉ L M ω M
2. BIf , then accepts and will halt by reaching at final state ω ∉ L M
3. CIf , then halts without reaching to acceptable state ω ∈ L M
4. DIf , then halts without reaching to an acceptable state

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: C. If , then halts without reaching to acceptable state ω ∈ L M

Explanation

A recursive language's TM halts on every input: it accepts strings in L and halts in a non-accepting state for strings not in L.