Proof Overview
We need to prove that some time class TIME(g(n)) is strictly larger than some time class TIME(f(n)). We do this by constructing a machine which cannot be in TIME(f(n)), by diagonalization. We then show that the machine is in TIME(g(n)), using a simulator machine.
Read more about this topic: Time Hierarchy Theorem
Famous quotes containing the word proof:
“If any doubt has arisen as to me, my country [Virginia] will have my political creed in the form of a Declaration &c. which I was lately directed to draw. This will give decisive proof that my own sentiment concurred with the vote they instructed us to give.”
—Thomas Jefferson (17431826)