Here I wrap up this circle of ideas by giving examples of using the collapse operation c on the kinds of ordinals we were already using to create huge numbers. I show that c(tau[n+1]) = tau[n], which is exactly what we knew we needed to find an ordinal tau such that g "catches up" to f at tau. If you just want big numbers, I suggest contemplating the awesomeness of f_{tau+1}(3).