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

Certainly, although programming with Turing machines looks hard. r.e.s. made a Turing machine that exceeded Graham's number by mimicking an ordinal hierarchy;  that may be a good model to base on.