It is interesting to point out that for these complexity classes, an increase of a constant factor on the time or the space bounds does not change the complexity classes. The reason is that a TM with a larger alphabet set and a larger set of states can simulate, in one move, a constant number of moves of a TM with a smaller alphabet set and a smaller number of states. We only show these properties for deterministic complexity classes.

#### Proposition 1.12

*Proof*

Get *Theory of Computational Complexity, 2nd Edition* now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.