simple recursion
Смотреть что такое "simple recursion" в других словарях:
Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
Recursión de Levinson — Saltar a navegación, búsqueda La recursión de Levinson o de Levinson Durbin es un algoritmo del álgebra lineal para calcular en forma recursiva la solución de una ecuación que involucra una matriz de Toeplitz. El costo computacional es de Θ(n2),… … Wikipedia Español
Récursion 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… … Wikipédia en Français
Récursion terminale — En informatique, la récursion terminale (aussi appelée récursion finale, ou tail recursion en anglais) est un cas particulier de récursivité assimilée à une itération. Sommaire 1 Principe 2 Transformation en itération 3 Exemple … Wikipédia en Français
Simple set — In recursion theory a simple set is an example of a set which is recursively enumerable but not recursive. Definition A subset S of the natural numbers N is called simple if it satisfies the following properties # N S is infinite and contains no… … Wikipedia
Tail recursion — In computer science, tail recursion (or tail end recursion) is a special case of recursion in which the last operation of the function is a recursive call. Such recursions can be easily transformed to iterations. Replacing recursion with… … Wikipedia
Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… … Wikipedia
Algorithmus von Faddejew-Leverrier — Der Algorithmus von Faddejew Leverrier (nach Dmitri Konstantinowitsch Faddejew und Urbain Le Verrier) ist ein Verfahren, das für beliebige quadratische Matrizen die Koeffizienten des durch p(λ) = det(λI − A) definierten charakteristischen… … Deutsch Wikipedia
Rational zeta series — In mathematics, a rational zeta series is the representation of an arbitrary real number in terms of a series consisting of rational numbers and the Riemann zeta function or the Hurwitz zeta function. Specifically, given a real number x , the… … Wikipedia
