From the link you provided: > As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers. While I can't argue the speci

From the link you provided: > As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers. While I can't argue the specific details, I'm not surprised. BB numbers are not computable. Grahams number is.