General recursive function: Difference between revisions

Revision as of 15:51, 25 February 2002

Revision as of 06:58, 31 May 2002

Line 1:

The '''recursive functions''' are a class of functions which provide a formal model of computability under the conditions set forth by [[computability theory]]. Any operation which can be described by a recursive function is called computable; in this respect, recursive functions are similar to [[Turing machine|Turing machines]], [[Lambda calculus]], and other models of [[computation|computability]]. Recursive functions are related to [[primitive recursive function|primitive recursive functions]], and their inductive definition (below) builds upon that of the primitive recursive functions.

=== Definition ===