Primitive recursive

Definition: A total function which can be written using only nested conditional (if-then-else) statements and fixed iteration (for) loops.

Note: Ackermann's function is computable, but is not primitive recursive. Primitive recursion functions always terminate. More powerful languages have some functions which cannot be proved to either terminate or run forever.