• Dr. JenkemA
    link
    fedilink
    English
    arrow-up
    2
    ·
    edit-2
    1 month ago

    Most people would probably intuitively answer “no”, and most computer scientists agree, but this has still not been proven, so we actually don’t know.

    I disagree, I think most computer scientists believe that P != NP, at least when it comes to classical computers. If we believed that P = NP, then why would we bother with encryption?

    EDIT: nvm, I misread it.

    • SorteKanin@feddit.dk
      link
      fedilink
      arrow-up
      5
      ·
      edit-2
      1 month ago

      I think you’ve misunderstood 😅. Answering “no” to that question corresponds to P != NP (there are problems that are easy to verify but not easy to solve), while “yes” means P = NP (if a solution is easy to check, the problem must be easy to solve). So I am saying most people and most scientists believe P != NP exactly as you say.

      • Dr. JenkemA
        link
        fedilink
        English
        arrow-up
        4
        ·
        edit-2
        1 month ago

        Reading comprehension is hard my bad.

        Edit: wait no, it’s “easy” I’m just dumb.