How can I show that any language in NP can also be run on a P machine? I get that the resulting time wouldn\'t be polynomial.
Is it because any problem in NP can be s
