Re: How to proof primitive recursive?

In article
<b92cfe2d-1f07-4ded-a92f-b1563198b2a6@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
"fairchilddb@xxxxxxxxx" <fairchilddb@xxxxxxxxx> wrote:

I have trouble in proving this function
f(0) = 0 f(1) = 1 f(x+2) = f(x)^2 + f(x+1)
assume n belongs N

Presumably you mean *x* is in N.

Go back to the definition of "primitive recursive function", and rewrite
your given function to be in that general form.

--
---------------------------
| BBB b \ Barbara at LivingHistory stop co stop uk
| B B aa rrr b |
| BBB a a r bbb | Quidquid latine dictum sit,
| B B a a r b b | altum viditur.
| BBB aa a r bbb |
-----------------------------
.