Some ways of thinking algorithmically about impossibility

Abstract

Computational complexity lower bounds like P ≠ NP assert impossibility results for all possible programs of some restricted form. As there are presently enormous gaps in our lower bound knowledge, a central question on the minds of today's complexity theorists is how will we find better ways to reason about all efficient programs?