GATE Computer Science (CS) 2014 Shift 2 Solved Paper

© examsiri.com

Question : 26 of 65

Marks: +1, -0

Let A ≤_m B denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?

If A ≤_m B and B is recursive then A is recursive
If A ≤_m B and A is undecidable then B is undecidable.
If A ≤_m B and B is recursively enumerable then A is recursively enumerable
If A ≤_m B and B is not recursively enumerable then A is not recursively enumerable

Go to Question:

Prev Question

Next Question