The complexity of the problem solver generally increases faster than the complexity of the problem generator. For example, a general solver for "what is #{x} +

The complexity of the problem solver generally increases faster than the complexity of the problem generator. For example, a general solver for "what is #{x} + #{y}?" is relatively easy. A general solver for "what is the derivative of #{random_equasion_with_diffuculty(3)}?" requires a full computer algebra system. Take one more step into advanced mathematics, and things get more dicy -- automated theorem provers, for example, require human guiding and hints.