User blog comment:MilkyWay90/Yet another attempt at making a fast-growing function/@comment-35434595-20180709002245/@comment-30754445-20180709194240

@Planetn9ne

"So, would the growth rate be e0?"

No, it would grow much much much faster than that. In fact, it would grow faster than any function that can be programmed into a computer (on my googology scale, that's beyond level 500).

The e0-level variant will be (roughly speaking):

"The largest possible computable expression which can be proven to define a finite number with Peano Arithmetic, the proof being less than n symbols long".