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.
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
dbkwik:googology/p...iPageUsesTemplate | |
abstract |
|