problem that's easy to verify it somehow impossible to efficiently solve okay so this requires us to somehow reason about all easy programs one way or another so let me emphasize it P where's MP is only one of many questions of this kind many of which just I simply can't mention this talk I just want to mentioned the most prominent one there but they all sort of hint or at the same kind of thing reasoning about efficient computation we don't know how to do it okay so where lower bounds good for so they're impossibilities they'll say you