DSPACE
Sign in to saveIn 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.
~5 min read
Encyclopedic overview
6 sectionsContents
- Complexity classes
- Machine models
- Hierarchy theorem
- Relation with other complexity classes
- References
- External links
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.
==Complexity classes==
Excerpted from Wikipedia’s “DSPACE” article, available under the CC BY-SA 4.0 licence.