The set of all recursively enumerable language is

GATE 2018 Previous Year Paper Solution Question 7 – Computer Science

In this video question which was asked in the exam of GATE 2018 is discussed.

Question :- The set of all recursively enumerable language is

A. closed under complementation
B. closed under intersection
C. a subset of a set of all recursive languages
D. an uncountable set

Solution is given in the video.

M.TECH (CS), B.TECH (IT), SENIOR FACULTY, DIRECTOR