User blog:Primussupremus/Factorial summation tree function part 4 the Q function

We now come to the Q function or the 3rd layer in the fst(x) hierarchy what this Q function does is takes a function in the second layer and iterates a certain number of times. For example Q{5,5,5)(5) means that you take fst[5](5)#####(5) and make that the input of fst(x) You then produce an even larger number and put that into the input of x and produce an even larger number. You repeating this process of generating an even larger number and imputing it into the function 5 times all this is applied to the number 5. Another example is Q{10,10,10}(10) means that you take fst[10](10)##########(10) and make that the input of fst(x) you then produce an even larger number and input this new number into the function. You continue this process 10 times until you get to a number of which I have decided to call Q of quadruple 10. This 3rd layer of the factorial summation tree function hierarchy is quite powerful in comparison to the other layers beneath it but it is still weak compared to the 4th level. The 4th level of the hiearchy is also known as the M level of the hiearchy standing for metaphysical or mysterious due to the numbers being produced out of it being well mysterious to say the least. M{10,10,10,10}(10) means that you make Q{10,10,10}(10) the input of ten and produce an even larger number you then apply the new number too ten and produce an even larger number.You repeat this process Q{10,10,10}(10) times on ten producing a number of ungodly huge number. I use the term ungodly not in the religious sense but rather in the sense of how vast the final output is.