Call Support +91-85588-96644
TCYonline

Login

Sign Up

Please enter a Username or Email ID
Please enter a password
Keep me logged in
Please enter your name
Please enter your mobile number
You can't leave Captcha Code empty
By submitting this form, you agree to the Terms & Privacy Policy.
OR

Sign Up via Facebook

Sign Up via Google

Sign Up via Twitter

Download Software
Tests given

Download TCY App

App Image

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?

 
W can be recursively enumerable and Z is recursive.
W can be recursive and Z is recursively enumerable.
W is not recursively enumerable and Z is recursive.
W is not recursively enumerable and Z is not recursive.
Na

Reply


Please type your answer before submitting.
Submit

Https://gateoverflow.in/39721/gate2016-1-44

The question given is wrong. Please write the question correctly.