coja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agoEarly disappointmentlemmy.mlimagemessage-square93fedilinkarrow-up11.13Karrow-down118
arrow-up11.11Karrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agomessage-square93fedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up1arrow-down1·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
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