V2! so basically when you run this code (I am too scared to for future reasons) it defines a function superconcationation (I will call S) so S(a,b)=join(a,a,a,a,... with b a join a's) so S(10,2)=1010 as join(10,10)=1010 and Omegaconcationation (I will call OS) is defined as OS(x)=S(S(S(S... with x many S('s and I am doing OS(S(2^1024,9)) so roughly S(2^1024,9)↑↑S(2^1024,9) digits long yes digits not the value the value is around 10↑↑100 larger because that length approximation is a bad approximation
so if you did not know what x↑↑y means it means x↑x↑x↑x↑x... with y ↑x's so 2↑↑3=2↑2↑2 and you calculate this top to bottom so 2↑2=2^2=4 so 2^4=16 so 2↑↑3=16 and 2↑↑4=2↑2↑2↑2=2^2^2^2 and 2↑↑4=2^(2↑↑3)=2^16=65536 and 2↑↑5=2^65536 and this number has 19729 digits so this number made by this code is stupidly long. this is larger than G(64) larger than TREE(3). And with only 32 blocks impressive right? oh don't even try to approximate to any good amount the length I had to use a crappy approximation fitted for small numbers
