Two-dimensional analysis of algorithm cost. In Turing-machine terms: spatial complexity is how many cells of the tape are used; time complexity is how many head movements (steps) are performed. Moving an algorithm to the Turing-machine domain reduces classifying it as linear, quadratic, etc. to these two counts.