Let X be a recursive language and Y be a recursively enumerable

Home » Theory of Computation » Theory of computation miscellaneous » Question

Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y reduces to W, and Z reduces to X (reduction means the standard many-one reduction). Which one of the following statements is TRUE?

1. W can be recursively enumerable and Z is recursive.
2. W can be recursive and Z is recursively enumerable.
3. W is not recursively enumerable and Z is recursive.
4. W is not recursively enumerable and Z is not recursive.

Correct Option: C

NA