User blog comment:Alemagno12/Divine Presence/@comment-30118230-20170201194832

I give you credit for trying,but your definition of those functions is very weak.The only function that is well-defined is S and it is the only one that makes some sort of sence to me.

From what I understood C(A,B)=B.I don't know what "repeat A,B times" means,especially when R doesn't collapse into anything.RO make absolutely no sence to me.Would you explain more in-depth?And what let you think this is uncomputable,especially when it has no well-defined definition?And what made you think it's the largest number ever even if it WAS well-defined?Can you prove it?And even if it was that strong why do you need that recursive thing at the end?B only adds 1 to the growth rate of A.

Oh,and there is an infite loop at the last (unneeded) definition.C(n)=C(B(n-1)) and B(n-1) > n (if B(n) even made sence).

Also,when I'm criticizing it,I'm not trying to be a jerk,just helping you spot the problems in your definition,like how others did when I made MBOT.If anything I'm just trying to help :)