"Somehow, we had the idea of what a complexity class was, and now we saw that, in effect, a computer could—particularly a Turing machine—could keep track of, basically keep track of time, one n-squared time, one squared, two squared, three squared, and so forth, to keep track of those time intervals. That's what we needed in order to do the diagonalization. That was the final breakthrough."