User blog:Primussupremus/Analysing and formatting my notation part 3.

In this 3rd part of the analysis of my array notation I am going to analyze the {a,b,c|d,k} part of my notation.

Before I explain what's happening with {a,b,c|d,k} I need to go over the rule for {a,b,c|d} again as it is essential for the next rule.

{a,b,c|d}= {a,b,c} recursed d times for d>0

If d=0 {a,b,c|d} = {a,b,c} as no recursions are being applied to {a,b,c}

Otherwise {a,b,c|d}= {a,b,c} recursed into the b slot d times.

This rule allows numbers such as the puny Grahams number to be expressed as {3,6,3|64} is exactly equal to grahams number.

Now onto {a,b,c|d,k} where {a,b,c|d} is recursed k times.

Here is the rule for this section of the notation:

{a,b,c|d,k} = {a,b,c|d} recursed k times for k>0

If k=0 {a,b,c|d,k} = {a,b,c|d}. Otherwise {a,b,c|d,k} = {a,b,c|d} recursed k times.