Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
NSPACE
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Limitations== The measure of [[space complexity]] in terms of [[DSPACE]] is useful because it represents the total amount of memory that an actual computer would need to solve a given [[computational problem]] with a given [[algorithm]]. The reason is that DSPACE describes the space complexity used by [[deterministic Turing machine]]s, which can represent actual computers. On the other hand, NSPACE describes the space complexity of [[non-deterministic Turing machine]]s, which are not useful when trying to represent actual computers. For this reason, NSPACE is limited in its usefulness to real-world applications.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)