The middle-growing hierarchy is a hierarchy created by Googology Wiki user Ikosarakt1. The rules are as following: * \(m(0,n)=n+1\) * \(m(\alpha+1,n)=m(\alpha,m(\alpha,n))\) * \(m(\alpha,n)=m(\alpha[n],n)\)
| Identifier (URI) | Rank |
|---|---|
| dbkwik:resource/HPDL2LY9Hq8Y-YhQ_Bg4FQ== | 5.88129e-14 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
