Interestingly enough, the Ackermann function grows faster than all primitive recursive functions\. This is related to a rather deep connection between the consistency strength of a mathematical theory \(which sorts of results they are capable of proving\) and the slowest\-growing function for which the theory cannot prove "this function is defined on all integers\."

This sounds interesting! Would love to read more about this.