coja@lemmy.ml to Programmer Humor@lemmy.ml · 2 年前Early disappointmentlemmy.mlimagemessage-square90linkfedilinkarrow-up11.08Karrow-down119
arrow-up11.06Karrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 2 年前message-square90linkfedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up6arrow-down2·2 年前Nondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.
minus-squareChristian@lemmy.mllinkfedilinkarrow-up1·2 年前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.
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up1arrow-down1·2 年前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
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.
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