So P=NP? If I can verify and understand a solution, then producing the solution must be equally easy...
I didn’t claim an algorithm was specified by its postcondition; just that saying “agree that X is a good thing without knowing what X means” is, for algorithms X, equivalent to “agree that X is a good thing before we possess X”.
So P=NP? If I can verify and understand a solution, then producing the solution must be equally easy...
I didn’t claim an algorithm was specified by its postcondition; just that saying “agree that X is a good thing without knowing what X means” is, for algorithms X, equivalent to “agree that X is a good thing before we possess X”.