Fastest notation ever!!!

## [NOT ILL DEFINED] super extremely fast growing function

Note: defining all series is too extreme. I was defining lots of series, but it too extreme hard to define 1000 series. In 1000 series, it intended to be much faster than loader function and any computable function. It doesn’t mean it’s Uncomputable, but it’s not possible to find exact approximations other than this notation.

This function intended to can pass loader function and other computable functions. This is well defined and formalised. Google account password is the short form of Google account password password reset password pa. So Google account password announced to permanently make series of this notation and will never stop.

p(x,1) = p(x)

p(x) = x+1

p(x,y) = p(p(p(…(p(p(p(x,y-1),y-1),y-1)…),y-1),y-1) by p(x-1,y) nests, while p(0,y) = 1

p(x,x) > {x,x,x,x}

p(x,x,x) > {x,x,x,x,x}

p(x,,2) > {x,x+2(1)2}

p(x,2,,2) > {x,x,2(1)2}

p(x,,3) > {x,x+2(1)3}

p(x,,x) > {x,x+2(1)x}

p(x,,x,x) > {x,x(1)x,x,x}

p(x,,x,,x) > {x,x+1(1)(1)2}

p(x,,,2) > {x,x(2)2}

p(x,,,3) > {x,x(3)2}

p(x,,,x) > {x,x(0,1)2}

p(x,2(1)[1]{1}2) > X^^X&x

p(x,2(1)[1]{1}3) > X^^^X&x

p(x,2(1)[1]{1}x) > {X,X,X}&x

p(x,2(1)[1]{2}x) > {X,X(1)2}&x

p(x,2(1)[1]{1,2}x) > {X,X(1)X}&x

p(x,2(1)[2]{1}x) > {X,X(2)2}&x

p(x,2(1)[1,2]{1}2) > {X,X(0,1)2}&x

p(x,2(2)[1]{1}2) > X^^X&x&x

p(x,2(1,2)[1]{1}2) > {x,x/2}

p(x,2(1,,2)[1]{1}2) > {x,x//2}

p(x,2(1,2(1)[1]{1}2)[1]{1}2) > {x,x(1)2/2}

p(x,2((1))[1]{1}2) > {Lx,1}x,x

p(x,2(1\2)[1]{1}2) > {X&L,1}x,x

p(x,2(1\3)[1]{1}2) > {X&L&L,1}x,x

p(x,2(1\1,2)[1]{1}2) > {{L,L/2},1}x,x

p(x,2(1\1\2)[1]{1}2)

p(x,2(1\\2)[1]{1}2) = p(x,2(1\1\1\………\1\1\2)[1]{1}2)

p(x,2(1,2(1)[1]{1}2/2)2) = p(x,2(1\\\……\\\2)[1]{1}2)

p(x,2(1\22)[1]{1}2)

p(x,2(1\1\222)[1]{1}2)

p(x,2(1\22)[1]{1}2) = p(x,2(1\1\…1\1\22…22)[1]{1}2)

p(x,2(1\y2)[1]{1}2) = p(x,2(1\y-11\y-1…1\y-11\y-122…22)[1]{1}2)

p(x,2(1\[2]2)[1]{1}2) = p(x,2(1\1\…1\1\22…22)[1]{1}2)

p(x,2(1\[y]2)[1]{1}2) = p(x,2(1\1\…1\1\22…2[y-1]2)[1]{1}2)

p(x,2(1\[x][2]2)[1]{1}2) = p(x,2(1\[1\[1\[…[1\[1\[x]2]2]…]2]2]2)[1]{1}2) by x nests

p(x,2(1\[x][y]2)[1]{1}2) = p(x,2(1\[1\[1\[…[1\[1\[x]2]2]…]2]2]2[y-1])[1]{1}2) by x nests

p(x,2(1\[x][y][z]2)[1]{1}2) = x,2(1\[x][1\[1\[…[1\[1\[x]2]2]…]2]2]2[z-1])[1]{1}2) by y nests

p(x,2(1\{2}2)[1]{1}2) = p(x,2(1\[x][x][x]…[x][x][x]2)[1]{1}2) by x nests

p(x,2(1\{y}2)[1]{1}2) = p(x,2(1\[x][x][x]…[x][x][x]{y-1}2)[1]{1}2) by x nests

p(x,2(1\{x}{2}2)[1]{1}2) = p(x,2(1\{1\{1\{…{1\{1\{x}2}2}…}2}2}2}2)2) by x nests

p(x,2(1\{x}{y}2)[1]{1}2) = p(x,2(1\{1\{1\{…{1\{1\{x}2}2}…}2}2}2}{y-1}2)2) by x nests

p(x,2(1\[2]₃2)[1]{1}2) = p(x,2(1\{x}{x}{x}…{x}{x}{x}2)[1]{1}2) by x nests

p(x,2(1\[2]y2[1]{1}2) = p(x,2(1\[x]y-1[x]y-1[x]y-1…[x]y-1[x]y-1[x]y-12)[1]{1}2) by x nests

Results if this function growing in fastest way:

1. All series are well-defined
2. Fully formalised
3. Making grow too fast (up to Church Kleene ordinal in FGH)

The limit of this function intended to be bigger than BB(1919).

The limit of this function:

> BEAF

< Strong array notation (if x > s(x,x{1,,,,2}2))

p(x,,2) = p(x,x,x,…,x,x,x)

p(x,,y) = p(x,x,x,…,x,x,x,,y-1)

p(x,,,2) = p(x,,x,,x,,……,,x,,x,,x)

p(x,,,y) = p(x,,x,,x,,……,,x,,x,,x,,,y-1)

p(x,2(1)[1]{1}2) = p(x,,,…,,,x)

p(x,y(1)[1]{1}2) = p(x,,,…,,,x,y-1(1)[1]{1}2)

p(x,2(1)[1]{1}y) = p(x,,,…,,,x(1)[1]{1}y-1)

p(x,2(1)[1]{y}2) = p(x,2(1)[1]{1}x,,,…,,,x)

p(x,2(1)[2]{1}2) = p(x,2(1)[1]{x,2(1)[1]{…{x,2(1)[1]{x}2}…}2}2)

p(x,2(1)[y]{1}2) = p(x,2(1)[y-1]{x,2(1)[y-1]{…{x,2(1)[y-1]{x}2}…}2}2)

p(x,2(y)[1]{1}2) = p(x,2(y-1)[x,2(y-1)[…[x,2(y-1)[x]{1}2]…]{1}2]{1}2)

p(x,2((1))[1]{1}2) = p(x,2(x,2(x,2(…(x,2(x,2)[1]{1})…)[1]{1}2)[1]{1}2)[1]{1}2)

p(x,2(1\2)[1]{1}2) = p(x,2(((…(((x,2)))…)))[1]{1}2)

p(x,2(1\3)[1]{1}2)

p(x,2(1\1,2)[1]{1}2)

It intended to have hundreds of series.

Limit is nothing

Also it passes legions quickly