Given that Graham&#x27;s Number is an (over-)extension of the Ackermann-function that means that it&#x27;s still computable, correct?<p>Given the series leading up to Graham&#x27;s Number, G = g_64 (g_1, g_2, ...), BB(n) <i>will</i> outgrow g_n, right? If so what&#x27;s the smallest n such that BB(n) &gt; g_n?