User blog:Boboris02/Boris's ultima function

Hello,if you haven't read my blog post "Boris's sezration notation" or seen the page about it here or in my website,I suggest seeing one of the three,because it will be needed to be able to understand this function.(I suggest the page in my site,because in the blog post there are many mistakes and G_@ is not in the wiki page!)

If you have seen the blog post,then you may remember something called G_@.

With Ultra-sezration,we overtook the FGH (that's just what I think).

[n(g_@)n] >> f_small veblen ordinal (n)

[n(G_@)n] is equivalent to [n(gg_@)n]

[n(G↑↑2_@)n]~[n(@(@)n)n]

[n(G↑↑3_@)n]~[n([@(@²)n])n]

[n(G↑↑4_@)n]~[n([@(@^@)n])n]

[n(G↑↑5_@)n]~[n([@(@↑³@)n])n]

[n(G↑↑t_@)n]~[n([@(@↑...(t-2)...↑@)n])n] for t ≥ 5

We can even put G's inside arrays:[n([G,G]_@)n]

With all that being said,here is my function...

Ðµ(n)= [n([G([G([G([...([G([G,G]_@)G])...]_@)G]_@)G]_@)n] whith n+1 G's from the center out!

I think it's safe to say,that Ðµ(n) is one of the(if not the) fastest growing computable functions ever devised!

Tell me what you think in the comments and correct me if I'm wrong.

Page in my website here.