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

Yeah, it will be a form of Busy Beaver problem - we would need to know the earliest machine that computes one of a set of  functions.