• rockSlayer@lemmy.world
    link
    fedilink
    arrow-up
    1
    ·
    1 year ago

    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