coja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agoEarly disappointmentlemmy.mlimagemessage-square55fedilinkarrow-up1803arrow-down115
arrow-up1788arrow-down1imageEarly disappointmentlemmy.mlcoja@lemmy.ml to Programmer Humor@lemmy.ml · 1 year agomessage-square55fedilink
minus-squarerockSlayer@lemmy.worldlinkfedilinkarrow-up5arrow-down1·1 year agoNondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.
Nondeterministic turing machines are the same kind of impossible theoretical automaton as an NFA. They can theoretically solve NP problems.