> Any meaningful result is equally hard to verify. This is very much not true. A central class in complexity is NP whose problems are hard to answer but easy t

> Any meaningful result is equally hard to verify. This is very much not true. A central class in complexity is NP whose problems are hard to answer but easy to verify if the answer is yes. E.g. is there a path visiting all nodes in this graph of length less than 243000? Hard to answer but easy to check any proposed answer.