constructive function
11Computable 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 …
12Domain 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… …
13Church's thesis (constructive mathematics) — In constructive mathematics, Church s thesis is the mathematical assertion that all total functions are recursive. It gets its name after the informal Church–Turing thesis, which states that every algorithm is in fact a recursive function, but… …
14Veblen function — In mathematics, the Veblen functions are a hierarchy of functions from ordinals to ordinals, introduced by harvtxt|Veblen|1908. If phi;0 is any continuous strictly increasing function from ordinals to ordinals, then for any non zero ordinal α,… …
15Injective function — Injective redirects here. For injective modules, see Injective module. An injective function (is not a bijection) …
16Dirichlet eta function — For the modular form see Dedekind eta function. Dirichlet eta function η(s) in the complex plane. The color of a point s encodes the value of η(s). Strong colors denote values close to zero and hue encodes the value s argumen …
17Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger …
18Point spread function — The point spread function (PSF) describes the response of an imaging system to a point source or point object. A related but more general term for the PSF is a system s impulse response. The PSF in many contexts can be thought of as the extended… …
19Majority function — In Boolean logic, the majority function (also called the median operator) is a function from n inputs to one output. The value of the operation is false when n/2 or more arguments are false, and true otherwise. Alternatively, representing true… …
20Naum Akhiezer — Naum Ilyich Akhiezer Born 6 March 1901( …
