\begin{definition}[Definition:NP Complexity Class]
In computation theory, $NP$ is a complexity class in which there exists some nondeterministic Turing machine that will either:
: halt within $\map p {\size x}$ steps
or:
:run forever
where $p$ is a polynomial and $\size x$ is the length of the input to the Machine.
\end{definition}