DSPACE

In computational complexity theory, the complexity class DSPACE(f(n)) or SPACE(f(n)) is the set of problems of decision that can be solved in a deterministic Turing machine in O(f(n)) space and unlimited time. It is the deterministic counterpart of the NSPACE class.

The PSPACE complexity class can be defined in terms of DSPACE as:

PSPACE= k한 한 NDSPACE(nk){displaystyle {mbox{PSPACE}}=bigcup _{kin mathbb {N}}}{mbox{DSPACE}}}(n^{k})}}