Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

heisenberg

does P = NP?

  • 2 years ago
  • 2 years ago

  • This Question is Closed
  1. eig
    Best Response
    You've already chosen the best response.
    Medals 0

    This problem has not been solved yet. Anyway most computer scientists believe they are not equal.

    • 2 years ago
  2. danizhg
    Best Response
    You've already chosen the best response.
    Medals 0

    It is not. Did you mean the NP problem for algorithms such as GA

    • 2 years ago
  3. Duragon
    Best Response
    You've already chosen the best response.
    Medals 0

    lol really dude?

    • 2 years ago
  4. heisenberg
    Best Response
    You've already chosen the best response.
    Medals 0

    really, dudes! i know this is a subjective answer, but I was curious if anyone had their own opinion. "In a 2002 poll of 100 researchers, 61 believed the answer to be no, 9 believed the answer is yes, and 22 were unsure; 8 believed the question may be independent of the currently accepted axioms and so impossible to prove or disprove."

    • 2 years ago
  5. Duragon
    Best Response
    You've already chosen the best response.
    Medals 0

    I'll have to do some research, I'm fairly certain the scope of this problem is well beyond me xD

    • 2 years ago
  6. fedep3
    Best Response
    You've already chosen the best response.
    Medals 0

    am not an expert in the field, but i think the answer its no. the key is in the np-complete problems, but its hard to believe someone found an algorithm that runs in polinomial for SAT for example

    • 2 years ago
  7. drjefferson
    Best Response
    You've already chosen the best response.
    Medals 0

    This is one of the great unresolved questions in theoretical computer science, and stands up there with the Riemann hypothesis and similar challenges as a mathematical challenge so profound that no one knows the best way to approach it yet. People's "subjective" opinions on the matter are of historical and social interest only. It may be (though it is unlikely) that the question of whether P=NP is independent of the currently accepted axioms of set theory (ZF), and thus there is no way to prove or disprove it within that framework. But as a proposition about computations it is still either true or false.

    • 2 years ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.