Search Results for ""

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...

The Benney equation in 1+1 dimensions is the nonlinear partial differential equation ...

Let s(x,y,z) and t(x,y,z) be differentiable scalar functions defined at all points on a surface S. In computer graphics, the functions s and t often represent texture ...

The Burridge-Knopoff model is a system of differential equations used to model earthquakes using n points on a straight line, each of mass m, that interact with each other ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

What is the area of the largest square that can be inscribed on a unit cube (Trott 2004, p. 104)? The answer is 9/8, given by a square with vertices (1/4, 0, 0), (0, 1, 1/4), ...