User blog comment:Sbiis Saibian/Googology101 - Part II/@comment-25593348-20141028220553

Heres a good argument to the no self repeatings.

Step 1: find x(base), usually being a high googolistic number)

Step 2: create x(base)=x^(x), where the x's are initial the same as x(base) at start.

Step 3: repeat the equation x times.

5 as an example, 5≠5^5, but x(sub 1) does, x(sub 1)=5^5^5..., you get 5^5^5^5^5^5 end result, from x times

With a googoid number (any number relative to the bases (basises) of a googol, e.g: googol, trigoogol, googolplex, etc. in and of itself that a high function, but more attuned than the Ackermann function.