despite the shitty title this is a slow growing array notation
# means literally any array
Rules.)
- A(x) = x+1
- A(#, 1, 1, 1, (any amount of 1's)) = A(#)
- A(x,y) = x+y
- A(x,y,z) = x+y+z
- A(x,y,z,w,p,a,b,c,d,e..... etc) = z+y+z+w+p+a+b+c+d+e.... etc
- B(1)x = A(x) (this isn't that important)
- B(2)x = A(x, x, x..... etc with x amount of x's in the array), i.e B(2)2 = A(2,2) = 2+2 = 4. It's basically just squaring lmao
- B(3)x = B(2)B(2)B(2)...B(2)x with x B(2)x's. i.e B(3)2 = B(2)((B(2)2) = B(2)4 = A(4,4,4,4) = 4^2 = 16.
- B(4)x = B(3)B(3)B(3)...B(3)x with x B(3)x's. i.e B(4)2 = B(3)((B(3)2) = B(3)4 = B(2)((((B(2)(((B(2)((B(2)2) = B(2)(((B(2)((B(2)4) = B(2)((B(2)16) = 16^2 = 256.
- B(y)x = Recursion of B(y-1)x x times until you get down to 2. Fun fact: B(y)x is just = (B(y-1)x)^2 (i think)
- C(2)x = B(x)x
- C(y)x = Recursion of C(y-1)x x times until you get down to 2. i.e C(4)2 = C(3)((C(3)2) = C(3)(((C(2)((C(2)2) = C(3)(((C(2)((B(2)2) = C(3)((C(2)4) = ........... etc it's a shit ton of steps lmao
- D(2)x = C(x)x
- D(y)x = Recursion of D(y-1)x x times until you get down to 2.
- This repeats in a similar fashion for all other alphabetical characters. i.e D(y)x = Recursion of D(y-1)x x times until you get down to 2.
- Once you get to Z, just numerate the alphabet characters. I.e, {1}(y)x is just A(y)x, {4}(y)x is just D(y)x and so on. Past Z is just {27}(y)x and so on with the same recursion patterns as previous functions.
- Eventually you'll get to stuff like {A(b)c}(y)x or {{A(b)c}(d)e}(y)x. Once you get to {A(x)x}(x)x, you can label that as 2A;x; since there are 2 layers (there's 2 (x)x's) and all of the numbers are x. You can label {{A(x)x}(x)x}(x)x as 3A;x; since there are 3 layers (there's 3 (x)x's)) and all of the numbers are x. One more example, you can label {{{D(x)x}(x)x}(x)x}(x)x as 4D;x;, or 4{4};x; since D is {4}.
- WIP!
whats the growth rate of this so far i need to know