User blog:Billicusp/messing around

Okay, I just figured out something that would (possibly) create the largest number ever. "Possibly" because I don't understand how FOOT works. So anyway, it starts like this:

•A(n)=Rayo(n)

•A(n,m)=the largest number creatable in mth order set theory in n symbols or less

Still a naive extension at this point. But I continue:

•A(n,m,l)=first, find A(n,m). Then m becomes the value of A(n,m). Repeat l times.

•A(n,m,l,k)=find A(n,m,l). Then l becomes the value of A(n,m,l). Repeat k times.

•A(n,m,l,k,j)=find A(n,m,l,k). Then k becomes the value of A(n,m,l,k). Repeat j times.

So this can be generalized as A(#x,y)=A(#A(#x),y-1). Furthermore:

•A2(n,m)=A(n,n,...,n,n) w/ m n's

•A2(#x,y)=A2(#A2(#x),y-1)

•A3(n,m)=A2(n,n,...,n,n) w// m n's

•A3(#x,y)=A3(#A3(#x),y-1)

So this can be generalized further by saying

1. Ac(n,m)=Ac-1(n,n,...,n,n)

2. Ac(#1)=Ac(#)

3. A(n,m)=the largest number creatable in n symbols or less in mth order set theory

4. Ac(#x,y)=Ac(#Ac(#x),y-1)

so, yeah. more to come

i promise it didn't look like BEAF in my head