Question

A language L is said to be Turing decidable if:

(a) recursive

(b) TM recognizes L

(c) TM accepts L

(d) None of the mentioned

The question was posed to me in an internship interview.

I'm obligated to ask this question of The Language of Turing Machine-2 topic in portion Introduction to Turing Machines of Automata Theory

Answer 1

Correct answer is (a, b)

The explanation is: A language L is recursively ennumerable if there is a turing machine that accepts L, and recursive if there is a TM that recognizes L.(Sometimes these languages are alse called Turing-acceptable and Turing-decidable respectively).