Algorithmic Complexity (Encyclopedia of Science and Religion)
Algorithmic complexity measures the computational resources needed to solve computational problems. Computational resources are measured in terms of either time (i.e., number of elementary computational steps per second) or space (i.e., size of memory, usually measured in bits or bytes) or some combination of the two. If computational devices had unlimited memory and could perform calculations instantaneously, algorithmic complexity would not be an issue. All real-world computers, however, have limited memory and perform calculations at fixed rates. The more time and space required to run an algorithm, the greater its algorithmic complexity.
See also COMPLEXITY
WILLIAM A. DEMBSKI