Search Results for ""

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 ...

A node which is one graph edge further away from a given node in a rooted tree.

A prime factorization algorithm.

A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.

Experimental mathematics is a type of mathematical investigation in which computation is used to investigate mathematical structures and identify their fundamental properties ...