# primitive recursive function

• 1Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by&#8230; …

Wikipedia

• 2Primitive recursive arithmetic — Primitive recursive arithmetic, or PRA, is a quantifier free formalization of the natural numbers. It was first proposed by Skolem [Thoralf Skolem (1923) The foundations of elementary arithmetic in Jean van Heijenoort, translator and ed. (1967)&#8230; …

Wikipedia

• 3Recursive function — may refer to: Recursion (computer science), a procedure or subroutine, implemented in a programming language, whose implementation references itself A total computable function, a function which is defined for all possible inputs See also μ&#8230; …

Wikipedia

• 4primitive recursive — adjective Of a function, capable of being constructed from the zero function, successor function, and projection functions, by a finite number of applications of composition and recursion …

Wiktionary

• 5Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ&#8230; …

Wikipedia

• 6μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ&#8230; …

Wikipedia

• 7Non-recursive function — might refer to: Recursion (computer science): a procedure or subroutine, implemented in a programming language, whose implementation references itself μ recursive function, defined from a particular formal model of computable functions using&#8230; …

Wikipedia

• 8Recursive — may refer to:*Recursion *Recursively enumerable language *Recursively enumerable set *Recursive filter *Recursive function *Recursive language *Recursive acronym *Recursive set *Primitive recursive function …

Wikipedia

• 9Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …

Wikipedia

• 10Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more&#8230; …

Wikipedia

• 11recursive — A procedure that is applied once, and then applied to the result of that application, and so on. A recursive definition (definition by induction) defines the result of some operation for 0, and then the result for any number n + 1 in terms of the …

Philosophy dictionary

• 12Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive&#8230; …

Wikipedia

• 13Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …

Wikipedia

• 14Domain of a function — Venn diagram showing f, a function from domain X to codomain Y. The smaller oval inside Y is the image of f, sometimes called the range of f. In mathematics, the domain of definition or simply the domain of a function is the set of input or&#8230; …

Wikipedia

• 15Sudan function — In the theory of computation, the Sudan function is an example of a function that is recursive, but not primitive recursive. This is also true of the better known Ackermann function. The Sudan function was the first function having this property&#8230; …

Wikipedia

• 16Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops&#8230; …

Wikipedia

• 17Indicator function — The graph of the indicator function of a two dimensional subset of a square. In mathematics, an indicator function or a characteristic function is a function defined on a set X that indicates membership of an element in a subset A of …

Wikipedia

• 18Pairing function — In mathematics a pairing function is a process to uniquely encode two natural numbers into a single natural number.Any pairing function can be used in set theory to prove that integers and rational numbers have the same cardinality as natural&#8230; …

Wikipedia

• 19Fonction Récursive Primitive — Une fonction récursive primitive est une fonction définie principalement à l aide de fonctions primitives de récursion et de composition. Ces fonctions constituent un sous ensemble des fonctions récursives. Elles ont été initialement analysées&#8230; …

Wikipédia en Français

• 20Fonction recursive primitive — Fonction récursive primitive Une fonction récursive primitive est une fonction définie principalement à l aide de fonctions primitives de récursion et de composition. Ces fonctions constituent un sous ensemble des fonctions récursives. Elles ont&#8230; …

Wikipédia en Français