Let \(A \leq _m B\) denotes that language A is mapping reducible (also known…
PYQ GATE 2014
Let denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?
- A.
If
and B is recursive then A is recursive. - B.
If
and A is undecidable then B is undecidable. - C.
If
and B is recursively enumerable then A is recursively enumerable. - D.
If
and B is not recursively enumerable then A is not recursively enumerable.
Attempted by 109 students.
Sign up free to check your answer
Sign up freeLoading lesson…

