Go back
Bookmarks categorized by tags
cs/computation-theory.
The Halting Problem is a terrible example of NP-Harder
Turing Machines