DSPACE
From Wikipedia, the free encyclopedia
For digital repositories, see DSpace.
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical computer would need to solve a given computational problem with a given algorithm.
This article needs additional citations for verification. (October 2009) |