User blog comment:DrCeasium/Continued hyperfactorial array notation/@comment-5150073-20130327205450

By the way, if you even surpass BEAF and meameamealokkapoowa oompa, you still don't beat the world record. For the recursive notations, there also exists Bird's array notation which must have larger limit ordinal.

Non-recursive notations are also exist. Take for example, busy beaver function (which I can call busy robot function, see explanation in the article). However, the function that holds a world record is the Rayo's function, Ra(n).