User blog:DJGrex/Batrix Function (level 1)

Not long ago I finded Goodstein Functions pretty amazing, and it lead me to make this function. The Function is expressed as B(j)=k, where j is the seed, which is the number we're dealing with, and k is the length of the sequence – the # of steps it takes to reach 0. It is hard explain, but I shall my best.

I use square brackets around the number in any base b, and space between digit to avoid confusion when the base is higher than 10. It means for instance that [1 2]13 ≠ [12]13, since the first one is equal to 15 and the second one is equal 12, and therefor not the same.

The seed number is what we are starting, and it need to be written in base 2. Example: if the seed is 3 then you write it as 11 in base 2 or in the Batrix way of writing it: [1 1]2. The main thing is to find out long this seed number take to reach 0 through a process. The process is as following: increase the base by 1, then increase every number that was one less than the previous base by 1, afterward -1 the number (not the base).

j=1

Length is 3, therefor we can conclude B(1)=3

Let us try j=3 and see what it get us to.

B(3)=13

Let's do j=5

B(5)=c-1, and c is gigantic number which we can compare in FGH as being less than or equal to f25(12).

Already at 5 it's pretty huge. These I showed you are just a little example on a level 1 Batrix Function. The level 2 also include more rows, just like in matrix. It can reach fω2-scale.

Source: https://djgrexnumbers.wordpress.com/2016/11/23/batrix-function/