User blog:Primussupremus/More on the construction of my notation.

Last time we looked at (a,b,c#[x]|{Y}) where (a,b,c#[x]) is recursed an arbitrary number of times Y. For example (8,Z,8#[8,Z,8]|{8,Z,8#[8,Z,8]} is equal to (8,Z,8#[[8,Z,8]) recursed (8,Z,8#[[8,Z,8]) times. Lets say that this number is called A and the result of it is B and we say that this constitutes for one cycle. The next cycle is Take B and produce out C. The next cycle is take C and produce out D. You have to do this for Y cycles where Y in this case is equal to (8,Z,8#[[8,Z,8]). I have decided to call these smaller cycles mini cycles and the end result after Y cycles equal to 1 Great cycle. The next thing after this is to do repeated great cycles we write it like this this (a,b,c#[x]|{Y}#p)where p is the number of Great cycles. We use something called child cycles which are like mini cycles the only difference is that one child cycle is equal to one Great cycle or the value after Y cycles. You then have to continue the process you used for (a,b,c#[x]|{Y}) and arbitrary number of times P the result of this one magnificent cycle. The magnificent cycle is pretty powerful in the sense that as long as p is large enough you are going to get some pretty huge numbers.