GATE | GATE CS Mock 2018 | Question 62
A language L is called Turing-decidable (or just decidable), if there exists a Turing Machine M such that on input x, M accepts if x ∈ L, and M rejects otherwise. L is called undecidable if it is not decidable.
Which of following option is false?
(A) The class of decidable languages is closed under complement.
(B) The class of decidable languages is closed under union
(C) The class of decidable languages is closed under intersection
(D) None of these
Answer: (D)
Explanation: The class of decidable languages is closed under union, intersection, and complementation.
Option (D) is correct.
Quiz of this Question
Recommended Posts:
- GATE | GATE CS Mock 2018 | Set 2 | Question 50
- GATE | GATE CS Mock 2018 | Set 2 | Question 51
- GATE | GATE CS Mock 2018 | Set 2 | Question 52
- GATE | GATE CS Mock 2018 | Set 2 | Question 53
- GATE | GATE CS Mock 2018 | Set 2 | Question 54
- GATE | GATE CS Mock 2018 | Set 2 | Question 55
- GATE | GATE CS Mock 2018 | Set 2 | Question 56
- GATE | GATE CS Mock 2018 | Set 2 | Question 57
- GATE | GATE CS Mock 2018 | Set 2 | Question 58
- GATE | GATE CS Mock 2018 | Set 2 | Question 49
- GATE | GATE CS Mock 2018 | Set 2 | Question 43
- GATE | GATE CS Mock 2018 | Set 2 | Question 44
- GATE | GATE CS Mock 2018 | Set 2 | Question 45
- GATE | GATE CS Mock 2018 | Set 2 | Question 46
- GATE | GATE CS Mock 2018 | Set 2 | Question 47