User blog:B1mb0w/Beta Function Code Version 2

Beta Function - Sequence Generating Code
The Beta Function has been defined using program code shown below.

A separate blog will be written to explain how Sequence Generator Code is compiled and executed using a normal programming language ... Work in Progress.

Sequence Generating Code Version 2
The Beta Function is a significant re-design of the code used by the Alpha Function and will create long finite integer strings to define every large Veblen ordinal and FGH function for every finite integer (up to the size of \(f_{SV0}(n)\)). Refer to my other blogs on Unique Ordinal Representation and Program Code Version 4 for more background information.

Beta Function Description
 * \(\beta(r,v) = h^m(v)\) where
 * \(h^0(v) = f_{\gamma_0}^{u_0}(v)\) where \(u_0\) and \(\gamma_0\) are in base \(v\), i.e. only use integers between \(0 ... v-1\)
 * \(h^{n + 1}(v) = f_{\gamma_{n + 1}}^{u_{n + 1}}(h^n(v))\) where
 * \(u_{n + 1} < h^n(v)\) in base \(v\)
 * \(\gamma_{n + 1} < \gamma_n\) in base \(h^n(v)\) i.e. only use integers between \(0 ... h^n(v) - 1\)
 * \(\gamma_m = 0\), i.e. the function recursively continues until we reach ordinal zero.

and

\(\beta(v^{v+1},v) = f_{\varphi(1,0_{[v]})}(v) = f_{SVO}(v)\) by definition

The Beta Function can then be uniquely represented by a sequence of finite integers as follows:

\(\beta(r,v) == (v,h_0)\)

The Sequence Generating RuleSet is as follows:
 * \(h_x = (d<2,d(0:x<v-u(x),1:(f_0<1,P_h = 1)))\)
 * \(f_x = (g_x,g_x((0,0,0):h_u,(h_U,(f_{x+1}<g_x,P_h=d-h_U)))\)
 * \(g_x = (q<v+1,g_{[q]},n_0<q,t_x)\)
 * \(n_x = (Q,t_A,g_{[Q]},n_{x+1})\)
 * \(t_x = (h_T,g_E,g_C,g_x)\)

The convention used for the parameters is:
 * Sequence function (e.g. \(h\)) defines the substitution sequences to replace any instance of the sequence function.
 * Instance of a Sequence function (e.g. \(g_0\)) is denoted by a lowercase letter with a subscript.
 * Lower case letter (e.g. \(q\)) with no subscript, denotes a finite integer greater or equal to 0
 * Upper case letter (e.g. \(Q\)) with no subscript, denotes a finite integer greater or equal to 1
 * Upper case letter (e.g. \(P_h\)) with a subscript denotes variables - TO BE EXPLAINED FURTHER - in my blog on Sequence Generator Code ... Work in Progress
 * The colon (e.g. \(:\)) denotes decision trees - TO BE EXPLAINED FURTHER - in my blog on Sequence Generator Code ... Work in Progress
 * The less than symbol (e.g. \(<\)) denotes constraints - - TO BE EXPLAINED FURTHER - in my blog on Sequence Generator Code ... Work in Progress

These rulesets are intended to be generated in a recursive way beginning with an initial h sequence. For example, a typical start for generating a sequence is:
 * \((v,h_0)\)
 * \((v,(d<2,d(0:x<v-u(x),1:(f_0<1,P_h = 1))))\)
 * Let \(d = 1\)
 * \((v,(1,(f_0<1,P_h = 1)))\)
 * \((v,(1,((g_0,g_0((0,0,0):h_u,(h_U,(f_1<g_0,P_h=d-h_U)))<1,P_h = 1)))\)
 * \((v,(1,(((q<v+1,g_{[q]},n_0<q,t_0),g_0((0,0,0):h_u,(h_U,(f_1<g_0,P_h=d-h_U)))<1,P_h = 1)))\)
 * \((v,(1,(((q<v+1,g_{[q]},(Q,t_A,g_{[Q]},n_{x+1})<q,t_0),g_0((0,0,0):h_u,etc.)\)
 * \((v,(1,(((q<v+1,g_{[q]},(Q,(h_T,g_E,g_C,g_A),g_{[Q]},n_{x+1})<q,t_0),g_0((0,0,0):h_u,etc.)\)

The sequences explode quickly as seen in this example:
 * \((v,(1,(((q<v+1,g_{[q]},(Q,(h_T,g_E,g_C,g_A),g_{[Q]},n_{x+1})<q,t_0),g_0((0,0,0):h_u,etc.)\)
 * Let \(q = 2\)
 * \((v,(1,(((2,g_{[2]},(Q,(h_T,g_E,g_C,g_A),g_{[Q]},n_{x+1})<q,t_0),g_0((0,0,0):h_u,etc.)\)
 * \((v,(1,(((2,g_1,g_2,(Q,(h_T,g_E,g_C,g_A),g_{[Q]},n_{x+1})<q,t_0),g_0((0,0,0):h_u,etc.)\)
 * \((v,(1,(((2,(q<v+1,g_{[q]},n_0<q,t_1),g_2,(Q,(h_T,g_E,g_C,g_A),g_{[Q]},n_{x+1})<q,t_0),etc.)\)

The sequences are not structured other than the implied sequence order of the elements. Therefore all internal brackets can be dropped:
 * \((v,1,2,q,g_{[q]},n_0,t_1,g_2,Q,h_T,g_E,g_C,g_A,g_{[Q]},n_{x+1},t_0,g_0((0,0,0):h_u,(h_U,f_1))))\)

The sequences are guaranteed to be finite because of sequence limiting rules:
 * \(h_x = (d<2,d(0:x<v-u(x),1:(f_0<1,P_h = 1)))\) - TO BE EXPLAINED FURTHER - in my blog on Sequence Generator Code ... Work in Progress

Granularity Examples \(\beta(?,3)\) to \(\beta(?,3)\)
Version 2 makes it possible to:

WORK IN PROGRESS

Test Bed for Version 2
Below is the test bed and various results using version 2.

\(\beta(0,2) = 0 \)

WORK IN PROGRESS