1102
submitted 1 year ago by coja@lemmy.ml to c/programmerhumor@lemmy.ml
you are viewing a single comment's thread
view the rest of the comments
[-] rockSlayer@lemmy.world 4 points 1 year ago

Nondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.

[-] christian@lemmy.ml 1 points 1 year ago

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.

[-] rockSlayer@lemmy.world 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

this post was submitted on 19 Jul 2023
1102 points (98.4% liked)

Programmer Humor

32707 readers
516 users here now

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

Rules:

founded 5 years ago
MODERATORS