A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 ?
a. W can be recursively enumerable and Z is recursive
b. W an be recursive and Z is recursively enumerable
c. W is not recursively enumerable and Z is recursive
d. W is not recursively enumerable and Z is not recursive
Answer:W is not recursively enumerable and Z is recursive
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: