Recursively enumerable language closed under intersection
Answers
Answered by
5
Recursively enumerable languages are not closed under set difference or complementation. The set difference L − P may or may not be recursively enumerable. If L is recursively enumerable, then the complement of L is recursively enumerable if and only if L is also recursive.
However, the set of Turing-recognizable languages is not closed under complement. Theorem 6: The set of Turing-decidable languages is closed under union, intersection, and complement.
However, the set of Turing-recognizable languages is not closed under complement. Theorem 6: The set of Turing-decidable languages is closed under union, intersection, and complement.
Similar questions
Geography,
5 months ago
Social Sciences,
5 months ago
Business Studies,
11 months ago
English,
1 year ago
Hindi,
1 year ago