time hierarchy theorem

Noun

 * 1)  A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide.