User blog:Pellucidar12/My (probably futile) attempt at the largest number

This is probably either a naive extension or based on an idea that just doesn't work, but I can't get it out of my head.

Okay, first define a process that creates a new function c(n) based on two input functions a(n) and b(n), where c(n) dominates b(n) to the same extent that b(n) dominates a(n). For example:

If a(n) = n + 1, b(n) = n + 2, then c(n) = n + 4

If a(n) = n^2, b(n) = n^4, then c(n) = n^8

If a(n) = n^2, b(n) = n^n, then c(n) = n tetrated to n (sorry, I don't know how to insert the symbols)

Now make a(n) = the inverse FOOT function, and b(n) = the FOOT function, so c(n) is a function that dominates the FOOT function to the same extent that the FOOT function dominates the inverse FOOT function. We'll call this function super FOOT (sFOOT for short).

Now we define the number sFOOT(BB(Googolplex)) as SF1.

Now go back to the process for making new functions, and make a function that dominates sFOOT to the same extent that sFOOT dominates the inverse sFOOT function, and then make a function that dominates that function to the same extent as it dominates its inverse, etc. Iterate this process SF1 times, The result we'll call the hyper FOOT function (hFOOT for short).

Now my number is hFOOT SF1 (SF1). That is, hFOOT(SF1) iterated SF1 times (the first SF1 should be in superscript but I can't figure out how to do that in this editor).

Please be gentle when ripping this apart.