Re: How to proof primitive recursive?
- From: paetz.spam@xxxxxxx (Thomas Paetz)
- Date: Mon, 14 Jan 2008 14:21:16 +0000 (UTC)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
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
Recurѕion along the course of values is your friend...
- --
Cheers, Tom
*** PGP Key available at <paetz.sdf-eu.org> ***
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.2 (GNU/Linux)
iD8DBQFHi2/V+zNZJAcIbcYRApjuAJ9CnUcKVgvtuASFvQhkcrXvn+/7rACg2VUV
jTxpdZyUXypPGVglpgnxBNc=
=rfK5
-----END PGP SIGNATURE-----
.
- References:
- How to proof primitive recursive?
- From: fairchilddb@xxxxxxxxx
- How to proof primitive recursive?
- Prev by Date: Re: Final Call for papers
- Next by Date: CFP: 8th International Conference on Hybrid Intelligent Systems (HIS 2008)
- Previous by thread: Re: How to proof primitive recursive?
- Next by thread: CFP: 8th International Conference on Hybrid Intelligent Systems (HIS 2008)
- Index(es):
Relevant Pages
|
