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 |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
