Search Results for ""

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 number of ways of folding a strip of stamps has several possible variants. Considering only positions of the hinges for unlabeled stamps without regard to orientation of ...

The number of data points which fall within a given class in a frequency distribution.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.

A family of subsets of a topological space such that every point has a neighborhood which intersects only a finite number of them.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.