coja@lemmy.ml to Programmer Humor@lemmy.ml · 2 years agoEarly disappointmentlemmy.mlimagemessage-square36fedilinkarrow-up1753arrow-down114
arrow-up1739arrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 2 years agomessage-square36fedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up1arrow-down1·2 years 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
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