# P vs NP (Computer Science)

#### shamieh

##### Active member
Didn't know what forum to post this in..There are some brilliant people on this forum, just wanted to know your thoughts on the P vs NP problem in Computer Science? Do you think it will ever be solved? I think P != NP. That being said, I do believe it could be solved but not with normal mathematics. I believe that boolean algebra may be able to solve the problem through LOGIC. As far as statistical formulas creating a Computer AI, I just don't think it's possible. After all, we aren't machines.

#### mathbalarka

##### Well-known member
MHB Math Helper
Of course $\text{P} \neq \text{NP}$ , but I believe this is more or less undecidable.

#### shamieh

##### Active member
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.

#### mathbalarka

##### Well-known member
MHB Math Helper
Most problems are more or less undecidable whether in P or NP, so I can't really give you some nontrivial ones. What background have you got in computer science?

#### ModusPonens

##### Well-known member
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 a P problem is the inversion of a matrix.

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 don't have an algorithm to solve them which takes a number of steps that is a polynomial on the input. But this special class of problems also has the property that if you could find a polynomial algorithm to solve one of them, you would solve all of them in polynomial time.

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.