Which of the following technique is used to find whether a natural language isnt recursive ennumerable?
(a) Diagonalization
(b) Recursive Induction
(c) Both (a) and (b)
(d) None of the mentioned
The question was asked during an interview for a job.
This intriguing question originated from The Diagonalization Languages topic in chapter Undecidability of Automata Theory