 Nonrecursive function

Nonrecursive 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 primitive recursion and the μ operator
 Computable function, or total recursive function, a function computable by a Turing machine
See also
 Recursive (disambiguation)
This disambiguation page lists articles associated with the same title.
If an internal link led you here, you may wish to change the link to point directly to the intended article.Categories: Disambiguation pages
Wikimedia Foundation. 2010.
Look at other dictionaries:
Primitive 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… … Wikipedia
Nonclassical logic — Non classical logics (and sometimes alternative logics) is the name given to formal systems which differ in a significant way from standard logical systems such as propositional and predicate logic. There are several ways in which this is done,… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Function (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
Recursive 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… … Wikipedia
recursive — 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
Nonmonotonic logic — A non monotonic logic is a formal logic whose consequence relation is not monotonic. Most studied formal logics have a monotonic consequence relation, meaning that adding a formula to a theory never produces a reduction of its set of consequences … Wikipedia
Nonstandard model — See also Interpretation (logic) In model theory, a discipline within mathematical logic, a non standard model is a model of a theory that is not isomorphic to the intended model (or standard model). If the intended model is infinite and the… … Wikipedia
Recursive recycling — is a technique where a function, in order to accomplish a task, calls itself with some part of the task or output from a previous step. In municipal solid waste and waste reclamation processing it is the process of extracting and converting… … Wikipedia
Recursive Bayesian estimation — is a general probabilistic approach for estimating an unknown probability density function recursively over time using incoming measurements and a mathematical process model. Model The true state x is assumed to be an unobserved Markov process,… … Wikipedia