- #1
shamieh
- 539
- 0
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.