Search Results for ""

In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...

Mann's iteration is the dynamical system defined for a continuous function f:[0,1]->[0,1], x_n=1/nsum_(k=0)^(n-1)f(x_k) with x_0 in [0,1]. It can also be written ...

A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...

Matrix decomposition refers to the transformation of a given matrix (often assumed to be a square matrix) into a given canonical form.

A group in which the elements are square matrices, the group multiplication law is matrix multiplication, and the group inverse is simply the matrix inverse. Every matrix ...

A polynomial with matrix coefficients. An nth order matrix polynomial in a variable t is given by P(t)=A_0+A_1t+A_2t^2+...+A_nt^n, where A_k are p×p square matrices.

A derived polygon with side ratios chosen as r=1/2 so that inscribed polygons are constructed by connecting the midpoints of the base polygon. For a triangle P, the ...

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).

A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).