Bounded minimalization is a technique for
- proving whether a promotive recursive function is turning computable or not
- proving whether a primitive recursive function is a total function or not
- generating primitive recursive functions
- generating partial recursive functions