If there exists a language L, for which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is called
| A. | recursive |
| B. | recursively enumerable |
| C. | NP-HARD |
| D. | none of these |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
