Fast Growing Hierarchy Calculator _hot_ -

: For the smallest index, the function is just simple addition. f0(n)=n+1f sub 0 of n equals n plus 1

. While other programs were content calculating grocery bills or tracking steps, fast growing hierarchy calculator

is an ordinal number. Its recursive definition is remarkably simple, yet it leads to explosive growth: : For the smallest index, the function is