Hardest problems in computer science: - does P = NP - the traveling salesmen - the halting problem - printers. making things print. things of that nature.
-
Existentialist comics ________________ Correct takes: III
Although the travelling salesman is an example of an NP hard problem so you still fucked up a wittle bit
-
-
What's a wittle?
-
It's "little" but with a "w" to be more insulting
- Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.