Search Results for ""

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

A shuffling algorithm used in a class of random number generators.

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

The partial differential equation u_(xxx)-1/8u_x^3+u_x(Ae^u+Be^(-u))=0.

The symbol ^ which is used to denote partial conjunction in symbolic logic. It also appears in several other contexts in mathematics and is sometimes called a "wedge". In ...

Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...