MCQOPTIONS
Saved Bookmarks
| 1. |
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? a) If A ≤m B and B is recursive then A is recursive. b) If A ≤m B and A is undecidable then B is undecidable. c) If A ≤m B and B is recursively enumerable then A is recursively enumerable. d) If A ≤m B and B is not recursively enumerable then A is not recursively enumerable. |
| A. | a |
| B. | b |
| C. | c |
| D. | d |
| Answer» E. | |