- Home
- Theory of Computation
- Recursively Enumerable Sets, Turing Machines and Undecidability
- Turing Machines
- Recursively Enumerable Language

This question was previously asked in

GATE CS 2018 Official Paper

- closed under complementation.
- closed under intersection.
a subset of the set of all recursive languages.

- an uncountable set

Option 2 : closed under intersection.

Free

IBPS SO IT Officer Mains: Full Mock Test

4845

60 Questions
60 Marks
45 Mins

C is false as the set of all recursively enumerable languages (semi-decidable) is a STRICT super set of the set of all recursive languages (decidable).

D is false as the set of all recursively enumerable languages (set of all Turing machines) is an infinite but countable set.

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,18,04,643+ Students

Start your FREE coaching now >>

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)