How to proof primitive recursive?
- From: "fairchilddb@xxxxxxxxx" <fairchilddb@xxxxxxxxx>
- Date: Sat, 12 Jan 2008 04:14:09 -0800 (PST)
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
.
- Follow-Ups:
- Re: How to proof primitive recursive?
- From: Thomas Paetz
- Re: How to proof primitive recursive?
- From: Barb Knox
- Re: How to proof primitive recursive?
- Prev by Date: Final Call for papers
- Next by Date: Re: How to proof primitive recursive?
- Previous by thread: Final Call for papers
- Next by thread: Re: How to proof primitive recursive?
- Index(es):
