recursion formula
11Levinson 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… …
12Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… …
13Propositional formula — In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional… …
14Viète's formula — This article is not about Viète s formulas for symmetric polynomials. In mathematics, the Viète formula, named after François Viète, is the following infinite product type representation of the mathematical constant… …
15Tupper's self-referential formula — is a self referential formula defined by Jeff Tupper that, when graphed in two dimensions, can visually reproduce the formula itself. It is used in various math and computer science courses as an exercise in graphing formulae.The formula was… …
16Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… …
17Ground expression — In mathematical logic, a ground term of a formal system is a term that does not contain any variables at all, and a closed term is a term that has no free variables. In first order logic all closed terms are ground terms, but in lambda calculus… …
18Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… …
19Cumulant — In probability theory and statistics, the cumulants κn of a probability distribution are a set of quantities that provide an alternative to the moments of the distribution. The moments determine the cumulants in the sense that any two probability …
20Wallenius' noncentral hypergeometric distribution — Introduction Probability mass function for Wallenius Noncentral Hypergeometric Distribution for different values of the odds ratio ω. m1 = 80, m2 = 60, n = 100, ω = 0.1 ... 20In probability theory and statistics, Wallenius noncentral… …
