If solving harder problems makes one more impressive as a mathematician, why isn't a mathematician considered impressive for computing something like 3 ↑ ↑ ↑ ↑ ↑ 3?
More generally, when a result has not yet been published, what kind of Turing-machine-like algorithm could quantify the importance of a result in pure mathematics in a way comparable to how humans do so?
Is a good mathematical result a question together with an answer (where here, the answer is taken to be the one with the shortest description length among the answers satisfying the question)? If so, is the description length of that question smaller than that of every other question that has the same answer as its answer?