I think I'm on the same page as what @tim wood quoted, meaning that in terms of complexity of computation can or whether a proof can deduce complexity of mathematical theorems. Not sure if that makes sense. I do specifically think it applies to non-congruent mathematics.

What do you think?