Question

Which of the following is/are not true for recursively ennumerable language?

(a) partially decidable

(b) Turing acceptable

(c) Turing Recognizable

(d) None of the mentioned

This question was posed to me in an online interview.

My question is based upon Programming Techniques-Storage and Subroutines topic in division Introduction to Turing Machines of Automata Theory

Answer 1

The correct answer is (d) None of the mentioned

To explain I would say: In automata theory, a formal language is called recursively ennumerable language or partially decidable or semi decidable or turing acceptable or turing recognizable if there exists a turing machine which will ennumerate all valid strings of the language.