Search results
Results from the WOW.Com Content Network
General recursive function. In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total ...
Fold (higher-order function) In functional programming, fold (also termed reduce, accumulate, aggregate, compress, or inject) refers to a family of higher-order functions that analyze a recursive data structure and through use of a given combining operation, recombine the results of recursively processing its constituent parts, building up a ...
Primitive recursive function. In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops (that is, an upper bound of the number of iterations of every loop is fixed before entering the loop). Primitive recursive functions form a strict ...
Transfer function. In engineering, a transfer function (also known as system function [1] or network function) of a system, sub-system, or component is a mathematical function that models the system's output for each possible input. [2] [3] [4] It is widely used in electronic engineering tools like circuit simulators and control systems.
Every function in the Grzegorczyk hierarchy is a primitive recursive function, and every primitive recursive function appears in the hierarchy at some level. The hierarchy deals with the rate at which the values of the functions grow; intuitively, functions in lower levels of the hierarchy grow slower than functions in the higher levels.
Mutual recursion. In mathematics and computer science, mutual recursion is a form of recursion where two mathematical or computational objects, such as functions or datatypes, are defined in terms of each other. [1] Mutual recursion is very common in functional programming and in some problem domains, such as recursive descent parsers, where ...
The primitive recursive functionals are the smallest collection of objects of finite type such that: The constant function f ( n) = 0 is a primitive recursive functional. The successor function g ( n) = n + 1 is a primitive recursive functional. For any type σ×τ, the functional K ( xσ, yτ) = x is a primitive recursive functional.
Recursive function may refer to: Recursive function (programming), a function which references itself. General recursive function, a computable partial function from natural numbers to natural numbers. Primitive recursive function, a function which can be computed with loops of bounded length. Another name for computable function.