Q16

MCQ1 mark, −0.33

Let $A\:\leq_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?

(A)

If $A\: \leq_m B$ and $B$ is recursive then $A$ is recursive.

(B)

If $A\: \leq_m B$ and $A$ is undecidable then $B$ is undecidable.

(C)

If $A\: \leq_m B$ and $B$ is recursively enumerable then $A$ is recursively enumerable.

(D)

If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

Loading…