coja to Programmer [email protected] • 1 year agoEarly disappointmentlemmy.mlimagemessage-square92fedilinkarrow-up11.12Karrow-down118
arrow-up11.1Karrow-down1imageEarly disappointmentlemmy.mlcoja to Programmer [email protected] • 1 year agomessage-square92fedilink
minus-square@[email protected]linkfedilink4•1 year agoNondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.
minus-squareChristianlinkfedilink1•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.
minus-square@[email protected]linkfedilink0•1 year agoThey 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