Complexity theorists sort problems into categories, called complexity classes, based on the resource demands of the best algorithms for solving them — that is, the algorithms that run fastest or use ...

What’s more, this result—a statement about what you can compute given a certain amount of space—also implies a second result, about what you cannot compute in a certain amount of time.