U(n) is an extremely fast-growing function devised by Chris Bird.[1] It is the fastest function he defined as of June 2013. Its growth rate is around \(\theta(\Omega_\omega)\) in the fast-growing hierarchy.

Using Bird's Hierarchical Hyper-Nested Array Notation, \(U(n) = \{3,n [1 [1 [1 [ \cdots [1 [1 /_n 1 /_n 2] 2] \cdots ] 2] 2] 2] 2\}\) (with n sets of square brackets).

See also Edit

Sources Edit

  1. Bird, Chris. Beyond Bird's Nested Arrays IV. Retrieved 2013-06-21.

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.