Undeconation refers to the function \(a \{\{\{\{\{\{\{\{\{\{\{1\}\}\}\}\}\}\}\}\}\}\} b = \{a,b,1,11\}\), using BEAF. In the fast-growing hierarchy, \(f_{\omega10+1}(n)\) is comparable to the growth rate of undeconation.
| Identifier (URI) | Rank |
|---|---|
| dbkwik:resource/1fwxK29342MQPJSYyGF7SQ== | 5.88129e-14 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
