Search Results for ""

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

A universal cellular automaton is a cellular automaton which, like a Turing machine, exhibits universality. von Neumann proved that an automaton consisting of cells with four ...

A series of the form sum_(n=0)^inftya_nJ_(nu+n)(z), (1) where nu is a real and J_(nu+n)(z) is a Bessel function of the first kind. Special cases are ...

A polynomial given in terms of the Neumann polynomials O_n(x) by S_n(x)=(2xO_n(x)-2cos^2(1/2npi))/n.

The converse of Fisher's theorem.

There are several theorems that generally are known by the generic name "Pappus's Theorem." They include Pappus's centroid theorem, the Pappus chain, Pappus's harmonic ...

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

The theorem of Möbius tetrads, also simply called Möbius's theorem by Baker (1925, p. 18), may be stated as follows. Let P_1, P_2, P_3, and P_4 be four arbitrary points in a ...