Search Results for ""

Let phi_x^((k)) denote the recursive function of k variables with Gödel number x, where (1) is normally omitted. Then if g is a partial recursive function, there exists an ...

A theorem, also called the iteration theorem, that makes use of the lambda notation introduced by Church. Let phi_x^((k)) denote the recursive function of k variables with ...

Given a Taylor series f(x)=f(x_0)+(x-x_0)f^'(x_0)+((x-x_0)^2)/(2!)f^('')(x_0)+... +((x-x_0)^n)/(n!)f^((n))(x_0)+R_n, (1) the error R_n after n terms is given by ...

Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...

The commutator series of a Lie algebra g, sometimes called the derived series, is the sequence of subalgebras recursively defined by g^(k+1)=[g^k,g^k], (1) with g^0=g. The ...

The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...

In n-dimensional Lorentzian space R^n=R^(1,n-1), the light cone C^(n-1) is defined to be the subset consisting of all vectors x=(x_0,x_1,...,x_(n-1)) (1) whose squared ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

The log-likelihood function F(theta) is defined to be the natural logarithm of the likelihood function L(theta). More precisely, F(theta)=lnL(theta), and so in particular, ...