Feesh number1

FEESSHHH fish fish fish

Fish number 1 is the smallest of the seven Fish numbers, created by Japanese googologist Fish. Fish number 1 is an extension to the Ackermann function, and the Fish function is comparable to f_ω^2(x), which is fast-growing hierarchy and I’ll talk about it later.

Define S₁(x, y) to be Ackermann’s function, namely:

• S₁(0, y) = y + 1
• S₁(x, 0) = S₁(x – 1, 1)
• S₁(x, y) = S₁(x – 1, S₁(x, y – 1))

Then define S₂ as a function that uses S₁ as its base, and S_n uses S_n-1 as its base. S_n is:

• S₁(0, y) = y + 1
• S_z(0, y) = S_z-1(y, y) for z > 1
• S_z(x, 0) = S_z(x – 1, 1)
• S_z(x, y) = S_z(x – 1, S_z(x, y – 1))

The fish function F₁(x) = S_x(x, x) grows about as fast as f_ω^2(x), and the function is equivalent to Taro’s multivariable Ackermann function, or S_z(x, y) = A(z, x, y).

To define Fish Number 1, we have to get complicated. Credits to Googology Wikia.

Define S map to be a map from a pair of number and function to a pair of number and function, or:

S : [m, f(x)] → [g(m), g(x)]

g(x) is:

• B(0, n) = f(n)
• B(m + 1, 0) = B(m, 1)
• B(m + 1, n + 1) = B(m, B(m + 1, n))
• g(x) = B(x, x)

Now define SS map to be a map from a set of number, function and S map to a set of number, function and S map. As follows:

SS: [m, f(x), S] → [n, g(x), S2]

S2, g(x) and n are:

• S2 = S^f(m)
• S2 : [m, f(x)] → [n, g(x)]

Apply SS map 63 times to [3, x + 1, S] to evaluate Fish number 1.

WOW!