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