Typical results when attempting to compute n powerexploded to m

Powerexplosion refers to the binary function \(a \{\{\{3\}\}\} b = \{a,b,3,3\} = \underbrace{a \{\{\{2\}\}\} a \{\{\{2\}\}\} \ldots \{\{\{2\}\}\} a \{\{\{2\}\}\} a}_{\text{b a's}}\), using BEAF.[1]

In the fast-growing hierarchy, \(f_{\omega2+3}(n)\) approximately corresponds to powerexplodal growth rate.

Sources

See also

Community content is available under CC-BY-SA unless otherwise noted.