NIELIT 2016 MAR Scientist B - Section C: 30

Question

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 1

Option C

Primitive recursive functions are closed under definitions of functions with bounded minimalization.

https://proofwiki.org/wiki/Bounded_Minimization_is_Primitive_Recursive