User blog comment:Deedlit11/Extending the fast-growing hierarchy to nonrecursive ordinals/@comment-30754445-20170419125319

Is there any particular reason for those wierd formulas 2^n and 3*5^m?

Why can't we simply say:

1. 0 is represented by 0.

2. O(2n)=O(n)+1

3. O(2m+1) refers to the mth Turing machine?

Looks like it gets you exactly the same kind of structure up to ω ck, with much more managable numbers.