User blog comment:Deedlit11/Extending the fast-growing hierarchy to nonrecursive ordinals/@comment-5150073-20130318093834/@comment-25418284-20130320235242

With some work I guess it's possible to come up with rules for a TM that computes, say, \(2 \uparrow\uparrow n\). Then we find its index in the TM list.