DSPACE

In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine.

Description

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 complexity measures, because it corresponds so closely to an important real-world resource: the amount of physical computer memory needed to run a given program.

See also

• Algorithm
• Computational complexity theory
• Computational problem
• Computational resource
• Computer science
• Deterministic Turing machine

External links

• DSPACE @ Wikipedia