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. It is one of the most well-studied.....
Found on http://en.wikipedia.org/wiki/DSPACE
No exact match found