User blog:KthulhuHimself/Terminal array notation.

My search for a satisfying googological function is at a turning point, as several new discoveries of mine are quite possibly going to generalize and simplify, let alone propel the idea of TsN furthermore than ever before.

I've been sitting on a couch, thinking, "A function's growth-speed can be increased by recursion, but what type of recursion would do that job best?" And came up with this.

Terminal array Notation, not to be confused with Terminal string Notation, the former owner of that name, is defined as follows:

Take a function f(n), and a base value n, and nest the function f(n) in the way the array describes.

<0> = f(n)

<1> = f(f(n))

<2> = f(f(f(n)))

 = f(f(f(f(f(f(...(f(n))))))))))))  (n nestings)

I need to go, and I'll get to this later.