this post was submitted on 19 Jul 2023
1094 points (98.3% liked)

Programmer Humor

32558 readers
598 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[โ€“] [email protected] 1 points 1 year ago (1 children)

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.

[โ€“] [email protected] 0 points 1 year ago

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