A theorem that establishes different classes of computational complexity based on the amount of time a Turing machine requires in order to solve a problem.
A theorem that establishes different classes of computational complexity based on the amount of time a Turing machine requires in order to solve a problem.