Resolving NP problem with a deterministic turing machine
Transforming non-deterministic moves from a NDTM to deterministic moves in a DTM, needs exponential states to be explained. For example, a non-deterministic move can be done in $2$ different possibilities. Hence, the different combination of $n$ non-deterministic moves needs $2^n$ different deterministic computation path to be explained, as an instance.