coja@lemmy.ml to Programmer Humor@lemmy.ml · 3 years agoEarly disappointmentlemmy.mlimagemessage-square43fedilinkarrow-up1763arrow-down114
arrow-up1749arrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 3 years agomessage-square43fedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up1arrow-down1·3 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