User blog comment:Undeadlift/Very Fast Growing Hierarchy/@comment-175.140.91.180-20150613131622

I think this is comparable to \(f_m+1(n)\) for all finite m and thus the "catching ordinal" is

\(\omega\). See http://googology.wikia.com/wiki/Talk:Fast-growing_hierarchy under the category faster growing hierarchies.