ちょっと海外Googologyに投稿する目的で、英語で書きます。ゴメンネ。書き上がったらいつか日本語に直します。
Some months ago, or about 1 year ago? I calculated Moser's number, using up-arrow notation. Later I posted movie about Moser, to Nico-nico-douga:
http://www.nicovideo.jp/watch/sm21303901 http://www.nicovideo.jp/watch/sm21303970
However, those movies are in Japanese, so I want to write down the process of calculation, in English.
It needs some knowledges of approximation between up-arrow notation and Steinhaus-Moser notation.
we need some preparations to calculate moser.
First, let's consider about this.
If b=a, this can be described as follows, using tetration operator,
using that step,
and,
Because of this approximation, the next can be also approximated as follows,
so, using pentation operator,
and also,
Similarly and generally,
And of course,
For example, if n is not small,
The differences of exponential heights between tetration of 10, are only 1 or 2.
So if N>>0, for any a,
Nextly, for example,
So, if N>>0,
Similarly,
Those dispositions are necessary to calculate polygon notation.
Now let's consider about n in p-gon, as n[p]. n is not small (at least 3 or more).
So when it reach n in square,
if n' =: n+1,
...Finally, in general,
2 is small, and so week, among up-arrow notation, so it's hard to apply . However, 2[p]=(2[p-1])[p-1], and if p is not small, 2[p-1] is large number. So (2[p-1])[p-1] can be applied approximation of n[p].
now [3] is exponentiation, and [4] is approximately tetration, similarly [5] is pentation, [6] is hexation, and [p] is, approximately .
So concidering pattern of previous section,
Can we approximate this more simply? Yes, there is two way to describe this structure.
can be written down as follows,
It is similar to 2[p]
Compareing these and Moser, in fact,
Because,
After all, However, Mega is already quite large number.
This might be the most simple approximation, using up-arrow notation...