The complexity class of languages that can be accepted by a deterministic Turing machine in polynomial time.