Primitive recursive function: Difference between revisions

Revision as of 15:28, 17 December 2001

Revision as of 01:19, 2 January 2002

Line 1:

'''Primitive recursive functions''' are a class of functions which form an important building block on the way to a full formalization of computability. They are defined using [[recursion]] and [[composition]] as central operations. The primitive recursive functions are a [[subset]] of the [[computablerecursive functionsfunction|recursive functions]] (which are exactly those functions

which we call "[[computatable functionsfunction|computable]]" -- see [[Equivalence of models of computation]]).