So, i've decided to scrap the original chick numbers and create a hierarchy of them.
So, I'll start small.
c0 = 10@(10)10
The next one needs a recursive function, but I don't want ellipses.
So, I'll use RecRec(n,m), and denote it R_c(n,m)
I change the base case to be this: m@(m)m.
c1 = R_c(c1,c1)
So, I'll automate the process and make a chick(n) (chicken ba dum tss)
chick(n) = R_c(cn-1,cn-1) where cn-1 = chick(cn-1), until n-1 = 0, where we use the c0 definition to ground it.
Chicken(n) = R_c(chick(c(cn)),chick(c(cn))) where c(cn) is the cnth chick number, where cn is the nth chick number.
So Chicken(0) = R_c(chick(c(10@(10)10),chick(c(10@(10)10))