Let S₂ = {⟨M⟩ | M is a TM with input alphabet {0, 1} such that |L(M)| = 2}, so S₂ contains all encodings of Turing machines whose languages contain exactly two strings in {0, 1}. Is S₂ decidable? Is it recognizable? Is it corecognizable? Answer the questions, and prove your answer.



Answer :

Other Questions