- Thread starter
- #1

- Thread starter shamieh
- Start date

- Thread starter
- #1

- Mar 22, 2013

- 573

Of course $\text{P} \neq \text{NP}$ , but I believe this is more or less undecidable.

- Thread starter
- #3

- Mar 22, 2013

- 573

- Jun 26, 2012

- 45

One example of a P problem is the inversion of a matrix.It seems like it is pretty obvious that P != NP, but how come no one can prove it? Can you give me a example? Like what are the problems people are running into? Or is it too advanced for me to even comprehend? I'm in Calculus II.

One example of an NP problem is to solve a minesweeper puzzle.

P problems are those which have an algorithm to solve them which takes a number of steps that is a polynomial on the input. In the matrix case, the input are the numbers in the matrix.

NP problems are those which

The thing is that you haven't still proved that there is no polynomial algorithm to solve an NP problem. That's the P vs NP millenium problem, which is worth $ 1 000 000.