The entire P vs NP problem basically boils down to ” is it easier to verify the correct answer than generate it?” And while it’s still unproven, in our universe the answer seems to be yes. So conditioning on P not equaling NP, it’s much easier to verify that it’s correct than to generate a proof or hypothesis.
The entire P vs NP problem basically boils down to ” is it easier to verify the correct answer than generate it?” And while it’s still unproven, in our universe the answer seems to be yes. So conditioning on P not equaling NP, it’s much easier to verify that it’s correct than to generate a proof or hypothesis.
But specific P problems can still be ‘too hard’ to solve practically.