The Elements of NP
A problem X is an element of NP if there is a non-deterministic polynomial-time algorithm that solves X.
All algorithms can be represented as Turing Machines
Therefore, each X?NP has a Non-Deterministic Turing Machine MX that accepts the elements of X in polynomial time