Revision as of 22:31, 2 September 2004 edit 68.82.29.89 (talk) →Example primitive recursive function definitions ← Previous edit		Revision as of 22:54, 2 September 2004 edit undo Timwi (talk \| contribs) Administrators 32,166 edits m →Relation to the recursive functions: rephrase Next edit →
Line 73: The set of primitive recursive functions does not encompass everything that we think of as computable. Nevertheless they form an important class and many of the functions normally studied in number theory, and approximations to real-valued functions, are primitive recursive. In order to formalize the full class of computable functions, we must allow for [[partial function]]s and introduce an additional operator to the above:, the ''unbounded search'' operator, ~~(see~~which gives rise to the [[recursive function]])s.

Primitive recursive function: Difference between revisions