View source for Automata qn 4 ← Automata qn 4

Consider the following languages

<math>A=\{M| TM M</math> accepts at most 2 distinct inputs<math>\}</math>

<math>B=\{M|TM M</math> accepts more than 2 distinct inputs<math>\}</math>

Identify the correct statement from the following:

(A) <math>A</math> is Turing recognizable <math>B</math> is not Turing recognizable

(B) <math>B</math> is Turing recognizable <math>A</math> is not Turing recognizable

(C) Both <math>A</math> and <math>B</math> are Turing recognizable

(D) Neither <math>A</math> nor <math>B</math> is Turing recognizable

Solution[edit]