User blog:B1mb0w/The Alpha Function

The Alpha Function
The Alpha Function has one parameter: \(\alpha(r)\) where r is any real number. It is derived from the The J Function and in particular the Sandpit \(J_8\) function.

This blog replaces two other previous attempts at this function. Links to the original blogs are available in the References section at the end of this blog. However, they will provide links back to here, and this blog will not use any of the material from those older attempts.

What is the Alpha Function
Edited: Late Feb 2016 to align to changes to my blog on Fundamental Sequences.

My motivation to create this function was to develop a finely grained number notation system for really big numbers. \(\alpha(1)\) for example can be used to reference the number 0. Therefore 1 is the Alpha Index for the number 0. Alpha needs to reference big numbers very quickly to be useful, therefore it uses the J Function for this purpose. Alpha should also be strictly hierarchical and every number \(a > b\), must reference larger numbers, so that \(\alpha(a) >> \alpha(b)\) in all cases. The function is finely grained. It accepts a real number input and offers some finesse to locate really big numbers.

The Alpha Function has a growth rate of up to the Small Veblen Ordinal (SVO).

Some Calculations
Refer to Sandpit \(J_8\) blog for all definitions and explanations:

\(\alpha(1.00) = J_8(<0,0>,0,0) = f_0^0(0) = 0\) \(\alpha(1.02) = J_8(<0,0>,0,1) = f_0^0(1) = 1\)

\(\alpha(1.1375) = J_8(<0,0>,2,2) = f_0^2(2) = 4\)

\(\alpha(1.57) = J_8(<0,1>,3,3) = f_1^3(3) = 24\)

\(\alpha(2.16) = J_8(<0,2>,2,3) = f_2^2(3) >>\) 400 Million

\(\alpha(2.23) = J_8(<0,2>,2,6) = f_2^2(6) >>\) Googol

\(\alpha(2.45) = J_8(<0,2>,4,4) = f_2^4(4) = f_3(4) >>\) Googolplex

\(\alpha(3.4) = J_8(<0,3>,3,4) = f_3^3(4) >> g_1\) where \(g_{64} = G\) is Graham's number

\(\alpha(10) = J_8(<1,1,<0,1>,<0,1>,<0,0>>,2,2) = f_{\omega}^2(2) = f_{\omega}(8)\) \(\alpha(10.018) = J_8(<1,1,<0,1>,<0,1>,<0,1>>,2,2) = f_{\omega+1}^2(2) = f_{\epsilon_0}(2)\)

\(>> g_{64} = G\) is Graham's number

\(\alpha(17.830251) = J_8(<1,2,<1,1,<0,1>,<0,2>,<0,0>>,<0,1>,<0,0>>,2,3)\)

\(= f_{\omega^{\omega^2.2}}^2(3)\)

\(\alpha(113.646367) = J_8(<2,<<0,2>,<0,0>>,1,<0,1>,<0,1>,<0,0>>,2,3)\)

\(= f_{\varphi(2,0)}^2(3) = f_{\zeta_0}^2(3)\)

\(\alpha(1000)\)

\(= J_8(<3,<<0,1>,<0,0>,<0,0>>,1,<0,1>,<0,1>,<0,0>>,2,4)\)

\(= f_{\varphi(1,0,0)}^2(4) = f_{\Gamma_0}^2(4) >> tree(3)\) i.e. the weak tree function

WORK IN PROGRESS

tree and TREE Functions
The Alpha function grows fast enough to reach the weak tree function but not the TREE function which grows faster than SVO.

\(\alpha(1000) = f_{\varphi(1,0,0)}^2(4) = f_{\Gamma_0}^2(4) >> tree(3)\)

The weak tree function grows at the rate of SVO but a lower bound for tree(3) is stated as \(2^{18}-4\) which is much much smaller. Therefore

\(\alpha(1000) >> tree(3) >> 2^{18}-4 >> 2^{17} >> 2^4.2^{13} >> 13.2^{13} >> f_2(13)\)

and

\(tree(3) >> f_2(13) = f_1^{13}(13) = J_8(<0,1>,13,13) = \alpha(2.143)\)

Appreciate some help here with better lower and upper bounds for tree(3).

WORK IN PROGRESS

Granularity Examples of this Function
\(Alpha(42.5) = f_{(\omega\uparrow\uparrow 4)(\omega\uparrow\uparrow 3)^{2}(\omega\uparrow\uparrow 3)(\omega\uparrow\uparrow 2)^{4}.(4) + 3}.(11))(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{3} + 4}(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{9} + 1}.(5)) + 8}.(2) + 4}^{9}(15)\)

\(Alpha(43) = f_{(\omega\uparrow\uparrow 4)(\omega\uparrow\uparrow 3)^{5}(\omega\uparrow\uparrow 3)^{3}.(2)(\omega\uparrow\uparrow 1)^{5}.(5) + 1)(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{5}.(3)(\omega\uparrow\uparrow 1).(5) + 2}(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{5}.(3)(\omega\uparrow\uparrow 1).(5) + 2}(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{5}.(3)(\omega\uparrow\uparrow 1).(5) + 2}.(3) + 3)(\omega\uparrow\uparrow 1)^{5}.(2)(\omega\uparrow\uparrow 1)^{3}(\omega\uparrow\uparrow 1)^{2}.(5)(\omega\uparrow\uparrow 1))}}^{2}(5)\)

\(Alpha(43.5) = f_{(\omega\uparrow\uparrow 4)(\omega\uparrow\uparrow 3)(\omega\uparrow\uparrow 1)^{6}.(5)(\omega\uparrow\uparrow 1)^{4}.(3) + 3}.(10) + 6}.(2)(\omega\uparrow\uparrow 2)^{4}(\omega\uparrow\uparrow 1)^{4}.(13) + 1)(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 2)(\omega\uparrow\uparrow 1)^{4}.(4)(\omega\uparrow\uparrow 1)^{3}.(2)(\omega\uparrow\uparrow 1)^{2}.(3) + 5}(\omega\uparrow\uparrow 1) + 1)}}^{2}(13)\)

Program Code and Description
Program code using Microsoft VBA and descriptions of the logic is available on other blogs. See the references section.

I'd like to write a javascript version of the program and make if available either on wikia or another site for live interaction with user entered real numbers. Does anybody know the simplest tools I can use to do this ?

Comments and Questions
Look forward to comments and questions. I am learning heaps by writing these blogs and correcting all the mistakes the community finds in them !

Cheers B1mb0w.