Does NP mean verifiable in polynomial time or solvable in polynomial time?
NP is a class of problems whose solution is verifiable in polynomial time on a deterministic Turing machine.
Alternatively, NP is a class of problems whose solution is solvable in polynomial time on a nondeterministic Turing machine. 

Please look here.