Prove Primitive Recursive Functions are Programs with Bounded FOR Loops
Budget: $10 – $30 USD
The first sentence of
https://en.wikipedia.org/wiki/Primitive_recursive_function
(Google: primitive recursive function wiki)
is:
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop can be determined before entering the loop).
Prove this and answer my questions and objections about your proof.
Note: I haven’t been to school in decades.
https://en.wikipedia.org/wiki/Primitive_recursive_function
(Google: primitive recursive function wiki)
is:
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop can be determined before entering the loop).
Prove this and answer my questions and objections about your proof.
Note: I haven’t been to school in decades.