User blog comment:DrCocktor/Googology Speech/@comment-36984051-20190429232354

It still can be a competition of making the largest number possible.

For example, most googologists want to create the most powerful recursive notation they can. For example, I made a notation that reaches the BHO in the FGH. But others have made more powerful notations, with new breakthroughs in making the strongest recursive notation.

In 2013, the fastest well-defined notation was Bird’s Array Notation, reaching ψ(Ω_Ω) in the FGH. But in 2014, Lawrence Hollom’s Hyperfactorial Array Notation (probably) went further, perhaps to ψ(ψΙ(0)) in the FGH. Then in 2015, Hyp Cos blew the doors off any other compatible notation with his Strong Array Notation which passes I, M, K, and lots of theoretical stuff.

Then in the following years, people have analyzed Strong Array Notation and filled some of the gaps, and we now know the limit of Dropping Array Notation to be C((Ω_2)ω,0) in the FGH.

And then there’s the Bashicu Matrix System, that easily beats all of Strong Array Notation.