Question

If A is reducible to B and A is not Recursively Enumerable then B is ______.

• A. Recursively Enumerable
• B. Recursively Enumerable but not recursive
• C. Recursive Language
• D. Not Recursively Enumerable

Answer 1

The correct option is D Not Recursively Enumerable

option (d)

If A is reducible to $B(A\le B)$ and A is not REL then B is also REL If $A\le B$ and B is REL then A is also REL.