Hello all! I have double/triple checked that this notation will work. I want you to find out its growth rate and ways to expand it. Thank you.
T notation, or tower notation, is a way of expressing towers in different notations and ways. The form of the notation is n(t^x)y. The rules are as followed below:
1. n(t)1 is always n
2. n(t)y is defined as a set of an operation done n(t)y-1 amount of times. This builds a tower of y height.
3. In n(t^x)y, if x=1, then cut out the x
4. In n(t^2)y, the y tells you how many side towers to create. A side tower is defined as the following: lets say there is a tower with a value of G, where G can be defined with n(t)y. A single side tower of this particular tower G would have a height of G. A side tower of th…
Read more >
I need your help in finding the expansion rate of various things in the following notation before I formally release it. I will release one bit of the notation at a time. I really appreciate your support and guidance:
Recursive Recursion Function (RRF) is a fast growing function that will hopefully use the power of eventual domination to overpower some functions. It tries to accomplish this by an endless supply of recursion using the results from the previous iteration of the notation. The StarThe star is the first portion of RRF and uses a simple recursion depending on the number it multiplies out to. Although RRF can be used on any function, exponentiation is a great way to begin as an introduction to the star. The simple definition is …
Read more >
Hello all! I was just wondering something about the list of googolisms. It extends from Class 0 to Uncomputable Numbers and stops at BIGFOOT. However, I would know if it is okay if I add a new class of numbers to the list after Uncomputable Numbers: the ordinals. This list would store all the ordinals (which are a lot bigger than all the other numbers!!!). Thank you for your consideration. A list, in order, will be provided below.
Small Veblen Ordinal
Large Veblen Ordinal
First Psi Ordinal
Third Psi Ordinal
Omega One Chess
Infinite Time Turing Machine OrdinalsRead more >
Hello all! This notation is still a work in progress on my website but I would like it if you could help me compare it to FGH or some other notation. That way I would know if I should edit the function's expansion rate. Thank you!
Article Summary (but still read the passage below): Alpha notation, depending on the power level (eg. number of As) creates towers of Chain Notation in the same exact way that Chain notation creates towers of Arrow notation. Beta notation does the same with Alpha notation and so on through the Greek alphabet.
Compound Recursion and Greek Notation (excerpt from the website at https://sites.google.com/site/jonathansgoogology/theories-and-misc/compound-recursion)
Compounded recursion is one of the most important featur…
Read more >
Now I have another outside source to talk to you about: MY VERY OWN WEBSITE. You can find it here:
I already added in my Hyper-L notation I talked about earlier with 95 new googolisms to go with it (but I still have yet to finish).
Please look at the website and write your thoughts down in this blog's comments field. It would be a great help to me!Read more >