GATE CS 2020 (Forenoon) — Question 36

Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ2 marks · −2/3 if wrongMedium

Which of the following languages are undecidable? Note that \( \langle M \rangle \) indicates encoding of the Turing machine M. \( L_1 = \{\langle M \rangle \mid L(M) = \phi\} \) \( L_2 = \{\langle M, w, q \rangle \mid M \text{ on input } w \text{ reaches state } q \text{ in exactly 100 steps}\} \) \( L_3 = \{\langle M \rangle \mid L(M) \text{ is not recursive}\} \) \( L_4 = \{\langle M \rangle \mid L(M) \text{ contains at least 21 members}\} \)
  1. A
    \( L_1, L_3 \) and \( L_4 \) only
  2. B
    \( L_1 \) and \( L_3 \) only
  3. C
    \( L_2 \) and \( L_3 \) only
  4. D
    \( L_2, L_3 \) and \( L_4 \) only
Practise the full 2020-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Turing Machines & UndecidabilityTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group