Which of the following languages are undecidable? Note that \(⟨M⟩\) indicates…
PYQ GATE 2020
Which of the following languages are undecidable? Note that indicates encoding of the Turing machine .
\(L_4= \{\left \langle M \right \rangle \mid L(M) \text{contains at least \(21\) members}\}\)
- A.
,, andonly - B.
andonly - C.
andonly - D.
,, andonly
Attempted by 135 students.
Sign up free to check your answer
Sign up freeLoading lesson…

