Comment Re:Am I Confused? (Score 2) 700
NP: set of problems you can solve in polynomial time on a non-deterministic Turing Machine
P:
Any problem in NP can be reduced to an NP-Complete problem (clique, vertex cover, 3-SAT, etc...) in polynomial time.
So, if you have an algorithm to solve an NP-Complete (like 3-SAT) problem in p(n) on a deterministic Turing Machine then you have NP == P.