Bounded minimalization is a technique for
| A. | proving whether a promotive recursive function is turning computable or not |
| B. | proving whether a primitive recursive function is a total function or not |
| C. | generating primitive recursive functions |
| D. | generating partial recursive functions |
|
Option: C Explanation : Click on Discuss to view users comments. |
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 |
|
Option: B Explanation : Click on Discuss to view users comments. |
Which of the following statement(s) is/are correct?
| A. | L = {an bn an | n = 1, 2, 3...} is recursively enumerable |
| B. | Recursive languages are closed under union |
| C. | Every recursive is closed under union |
| D. | All of these |
|
Option: D Explanation : Click on Discuss to view users comments. |
