Search Results for ""

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...

Let a and b be nonzero integers such that a^mb^n!=1 (except when m=n=0). Also let T(a,b) be the set of primes p for which p|(a^k-b) for some nonnegative integer k. Then ...

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...

The concept of a space is an extremely general and important mathematical construct. Members of the space obey certain addition properties. Spaces which have been ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

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

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...