coja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agoEarly disappointmentlemmy.mlimagemessage-square90fedilinkarrow-up11.03Karrow-down120
arrow-up11.01Karrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agomessage-square90fedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up6arrow-down2·1 year agoNondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.
minus-squareChristian@lemmy.mllinkfedilinkarrow-up1·1 year agoIt’s been a long long time since I touched this but I’m still almost positive deterministic machines can solve everything in NP already.
Nondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.
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.