Aarex's Function Array Notation

Aarex's Function Array Notation is the notation which based on Alemagno's Function Array Notation.

2-Entry

This goes up to 0/0/0. (0)/B can be simplify to 0/B and A/(0) can be simplify to A/0.

• n;0 = n^n
• n;A = n;B[n]
• Let define A such that the expression is n;A. Let A1 will be A.
  • Let An such that An-1 = '(An)/B' or An-1 = '0/(An)'
  • Find m such that Am is the last item of Ax set can be define.
  • If Ay = '(Ay+1)/B' and Am can be anything:
    • Replace Am to 0. Let B will be modified A.
    • a;B[1] = a;B
    • a;B[b] = a;B[b-1];B
  • Else:
    • Coming soon!

To compare A1/A2 and B1/B2, just compare A2 and B2 first then compare A1 and A2. And 'A/B' always greater than 0.

Let set n = (n-1)/0 after ;.

Linear

This goes up to 00.

Diagonalisers

This goes up to //.

Diagonaliser Functions

This goes up to ///.

Multiple Diagonaliser Functions

This goes up to \.

Higher Diagonaliser Functions 1

This goes up to |.

Higher Diagonaliser Functions 2

This goes up to DH.

Diagonaliser Hierarchy

This goes up to -.

Higher Diagonaliser Functions 3

This goes up to _.

Higher Diagonaliser Functions 4

This goes up to the current limit.