Difference between revisions of "DSPACE"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (Created page with "In computational complexity theory, '''DSPACE''' or '''SPACE''' is the computational resource describing the resource of memory space for a deterministic Turing mach...") |
Karl Jones (Talk | contribs) (→External links) |
||
| Line 19: | Line 19: | ||
* [https://en.wikipedia.org/wiki/DSPACE DSPACE] @ Wikipedia | * [https://en.wikipedia.org/wiki/DSPACE DSPACE] @ Wikipedia | ||
| + | |||
| + | [[Category:Complexity]] | ||
| + | [[Category:Computation]] | ||
| + | [[Category:Mathematics]] | ||
Latest revision as of 14:39, 22 April 2016
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
