I got this random idea earlier in class and it looked fun so I decided to make a function for it.

## Informal Definition

is a function that takes 2 arguments: an ordinal (it could be a successor ordinal) and a positive integer. It's based on the Fast growing hierarchy[1].

Basically, it's how many steps to take to reduce to using as a base. If you didn't get that, take this for example:

- (We don't count this one)
- (Victory!)

Therefore,

Let's try

- ...

That goes for a long time. I'll post the whole reduction part by part sometime later.

I guess the title was wrong or maybe I just need to do the reduction thing thousands of times to get to 0.

The question is, how "large" are the numbers created by this?