partial recursive function
partial recursive function A function on the natural numbers that can be obtained from certain initial functions by a finite number of applications of composition, primitive recursion, and minimization. In general the function may not be defined for certain values of its argument and so is a partial function. The initial functions used are normally the zero function, successor function, and projection functions. The partial recursive functions can be defined in many ways and, according to the Church–Turing thesis, are precisely the functions on natural numbers that can be defined by algorithms. See also primitive recursive function.
More From encyclopedia.com
Primitive Recursion , primitive recursive function A function that can be obtained from certain initial functions by a finite number of applications of composition and pri… functional , functional •annal, channel, flannel, impanel, multichannel, panel •cracknel •grapnel, shrapnel •carnal •antennal, crenel, fennel, kennel •regnal •ana… Function , A function is a mathematical relationship between two sets of real numbers. These sets of numbers are related to each other by a rule that assigns ea… Teleology , The term teleology locates a series of connected philosophical questions. If we grant that there is such a thing as purposive or goal-directed activi… GKS Abbrev. for graphical kernel system. , GKS Abbrev. for graphical kernel system. A set of graphical functions used by applications programmers with the names and functions defined in ISO 79… Functional Analysis , Few concepts in modern social science history have generated as much discussion as those of structure and function and the type of analysis associate…
You Might Also Like
NEARBY TERMS
partial recursive function