text1: Concrete bounding of computation time frequently produces complexity classes contingent upon what?
text2: This forms the basis for the complexity class P, which is the set of decision problems solvable by a deterministic Turing machine within polynomial time.