Meameamealokkapoowa oompa

Meameamealokkapoowa oompa is equal to \(\{\{L100,10\}_{10,10}\text{&}L,10\}_{10,10}\) in BEAF, or a meameamealokkapoowa-sized array of L's. Strictly speaking, Meameamealokkapoowa oompa is ill-defined by the ill-definedness of BEAF at that level. Therefore when we talk about Meameamealokkapoowa oompa, we are roughly assuming that there were a fixed extension of BEAF satisfying several desired properties. John Spencer was the first to ask for the definition of this number.

Meameamealokkapoowa oompa is often confused with another much smaller number, \(\{LLL \cdots LLL,10\}_{10,10}\), where there are simply meameamealokkapoowa L's in a single row.

For years it was considered the largest googologism Jonathan Bowers has yet defined. It would have been superseded in 2016 had Utter Oblivion been a properly defined number.

Howsoever a meameamealokkapoowa oompa is to be defined in a computable way, it is certainly smaller than Rayo's number, and is also believed to be beaten by Loader's number. The exact size of this number is controversial, due to not having a proper definition. Some estimates have put it as much larger than \(f_{\psi(\psi_I(0))}(10)\) (which is the approximate value of {100,100(1)/2} under the same analyses), whilst other analyses put it only slightly larger than the Large Veblen ordinal; and less than \(f_{\theta(\Omega^\Omega+\Omega)+1}(10)\).