This is the analysis of Greek Letter Notation and Notation Array Notation.

Since the Notation Array Notation is based on the Greek Letter Notation, I’ll analyze them at the same time.

The limit of the Greek Letter Notation and the Notation Array Notation are both fω^2 * 25(a).

Since Googology Wiki user Googology guy wants me to measure the power of his LND function in BEAF notation, slow growing hierarchy, hardy hierarchy, and fast growing hierarchy, I’ll analyze the LND function and its numbers here.

This document may look quite messy on mobile.

The limit of the LND function is fω + 1(n).