Question

Does P = NP?

Question 1 options:

1)

Yes

2)	Probably (but we don't know for sure)

3)	Probably not (but we don't know for sure)

4)

No

Answer 1

3. Probably not. (But we don't know for sure.)

P is polynomial time priblems. NP is non deterministic polynomial time.

If P=NP then the wolrd would be completely different place than we usually assume it to be. There will be a no fundamental gap between solving a problem and recognizing the solution once its found. Problems like finding a best move in a game of Chess or Factoring large digit numbers into prime factors will be easy. This will solve many problems in medical science like protein folding....

This problem is still unsolved in computer science.