For the complexity classes defined in this way, it is desirable to prove that relaxing the requirements on (say) computation time indeed defines a bigger set of problems.
What is an example of a measurement within a complexity class that would create a bigger set of problems if the bounds were relaxed?
computation time