of the ideal thing you would like to have something not as I'm sorry we don't care about polynomials exploration we just want to know how big is the computation gonna get so think something like any computer solving most instances might tend to for a bit problem these at least 10 to the 125 bits to be described so if you've got you know this kind of statement then your problem is just simply not solvable period okay so actually such a statement was proved by Meyer and stockmeyer in the 70s for a particular logic problem