Primitive Recursive Functions, References?
- From: RexButler@xxxxxxxxxxx
- Date: 14 May 2006 21:44:19 -0700
I am fairly familiar with the primitive recursive functions, but there
is not much information on the topic I could find on the internet.
Could someone direct me towards relevant resources?
It is interesting to note that for quite some time the primitive
recursive functions were thought to exhaust -all- computable functions.
Ackermann's function, which uses double induction, shows this is not
the case, as does a simple diagonal argument using the fact that all
primitive recursive functions are total. However, any recursively
enumerable set is the image of some PR function, and one could argue in
the vein of the Church-Turing thesis that the PR functions form the
intuitive class of 'iteration functions,' i.e. the transition functions
from one state to the next in effective computation models.
Being a mathematics graduate student, what is the CS view of primitive
recursive functions and their role?
Rex Butler
.
- Follow-Ups:
- Math errors in book Secret Life of Numbers
- From: carolyn . meinel
- Math errors in book Secret Life of Numbers
- Prev by Date: A question on matroids
- Next by Date: Math errors in book Secret Life of Numbers
- Previous by thread: A question on matroids
- Next by thread: Math errors in book Secret Life of Numbers
- Index(es):
Relevant Pages
|