GATE CS 2018 (Forenoon) — Question 17

Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ1 mark · −1/3 if wrongMedium

The set of all recursively enumerable languages is
  1. A
    closed under complementation.
  2. B
    closed under intersection.
  3. C
    a subset of the set of all recursive languages.
  4. D
    an uncountable set.
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
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