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)\)
| Graph IRI | Count |
|---|---|
| http://dbkwik.webdatacommons.org | 7 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
