Time hierarchy theorem

Given more time, a Turing machine can solve more problems

In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example, there are problems that can be solved with n2 time but not n time, where n is the input length.

From Wikipedia, under CC BY-SA. More on occurri.