1102
Early disappointment
(lemmy.ml)
Post funny things about programming here! (Or just rant about your favourite programming language.)
It's been a long long time since I touched this but I'm still almost positive deterministic machines can solve everything in NP already.
They exist in the same grammatical hierarchy so theoretically they can solve the same problems. What I should have said was that nondeterministic turing machines can solve NP problems in P