User blog:JHeroJr/A computable function

Because I don't think it's uncomputable.

My new function is the Fast-Growing Hierarchy  function FGH(n) = the biggest finite number that can be represented with n symbols in the language of the Fast-Growing Hierarchy A digit counts as a symbol.. If no finite number can be made with n Fast-Growing Hierarchy symbols, then the return value is 0. It is computable because FGH is computable (I think).

The sequence starts 0,0,0,0, but the fifth term is \(f_{\omega}(9)\) (HUGE!) and I don't really know any subsequent terms.

I can use some feedback.