Since deterministic Turing machines are special non-deterministic Turing machines, it is easily observed that each problem in P is also member of the class NP.
In what theoretical machine is it confirmed that a problem in P belies membership in the NP class?
Turing machines