pn (computing theory) The set of all problems that are solvable in polynomial time by a deterministic Turing machine