User blog:Cefe origol/Fast Growing Heiarchy of Heiarchies.

This is my fist ever wikia blog, so I probably will not be using some features. Also, this was only created to be able to redirect people whenever I need to use this notation(especially in big number competitions)

I have decided to create this function when I thought: "What if the fast growing heiarchy had $${f}_{n+1}(x)={f}_n^x(x)$$ instead of $${f}_{n+1}(x)={f}_n^{{f}_n(x)}(x)$$

The array heiarchy follows the following rules: 1- p{0,#}(x)=p{#}(x) 2- p{n}(x)=f_n(x)[Fast Growing Heiarchy] 3- p{a,#}(x)=p{a-1,#}^p{a-1,#}(x) when a is a successor ordinal 4- p{a,b,#}(x)=p{a[b],b,#}(x) when a is a limit ordinal 5- If the length of the array is a limiting ordinal a, it becomes one of the length a[x]. By such, my number(p{LVO(2)}(10^10^100)) is an array of the size of the large veblen ordinal, with every element being the large veblen ordinal, diagonalized to a googolplex. And thats me being merciful.