User blog comment:Mh314159/Growth rate question/@comment-35470197-20191124224759/@comment-39585023-20191201160216

Yes, I believe PBot has it correct. This is not a simple iteration of A, but rather a series of recursive functions that terminate with A as the base function, so the number of times A iterates is itself determined by a function with the growth rate of A. The same series of recursions yield w^w when they terminate with the successor function. Perhaps sometime I will post the specifics but stuff still tends to change fairly often. Thanks.