this post was submitted on 19 Jul 2023
1042 points (98.2% liked)

Programmer Humor

32380 readers
425 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
[โ€“] rockSlayer@lemmy.world 4 points 1 year ago (1 children)

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.