It’s vastly easier to understand a maths proof (almost any maths proof) than it is to invent one.
It’s a lot easier to verify a solution to a problem in NP than it is to generate one (by definition!, but a lot of problems turn out to be NP-complete)
It’s a lot easier to check that someone caught a cricket ball than it is to catch one.
It’s a lot easier to check that someone can drive than to teach them.
It’s a lot easier to tell whether a program can tell the difference between cats and dogs than to write a program that can.
Counterexamples:
It can be a easier to write a correct computer program than to verify it, and easier to fix the bugs than to find them.
It can be easier to find an algorithm than to prove that it works.
It’s vastly easier to understand a maths proof (almost any maths proof) than it is to invent one.
It’s a lot easier to verify a solution to a problem in NP than it is to generate one (by definition!, but a lot of problems turn out to be NP-complete)
It’s a lot easier to check that someone caught a cricket ball than it is to catch one.
It’s a lot easier to check that someone can drive than to teach them.
It’s a lot easier to tell whether a program can tell the difference between cats and dogs than to write a program that can.
Counterexamples:
It can be a easier to write a correct computer program than to verify it, and easier to fix the bugs than to find them.
It can be easier to find an algorithm than to prove that it works.