User blog comment:Simplicityaboveall/Extremely Large Numbers 3/@comment-29014792-20160801191948/@comment-5529393-20160801222832

Compare what you say with the following:

I will define the following function, which I call the Deedlit function: Deedlit(n) = n.

With the Deedlit function, I can beat any number!

For example, Deedlit(Rayo+1) is clearly bigger than Rayo's number.

I can also beat any number defined with the heshbar-q function. Say you define Simplicity = heshbar-Rayo (Rayo). This is a large number, bigger than Rayo. But, I will beat this with Deedlit(Simplicity + 1)!

So yeah, the Deedlit function can beat any number, as can any unbounded function.