"Extended Hyper-E notation"@en . . . "Hyper-E notation"@en . . "E# is not primitive recursive, and specifically the function E(n) = En##n eventually dominates all primitive recursive functions. In fact, in the fast-growing hierarchy, \\(n \\mapsto E100\\#\\#n\\) dominates \\(f_n\\) for all \\(n < \\omega\\) and is itself dominated by \\(f_\\omega\\). E# and xE# form part of a larger notation, the Extensible-E System, that also encompasses Cascading-E Notation. Nathan Ho and Wojowu proved termination for the rules of Hyper-E Notation."@en . . "E# is not primitive recursive, and specifically the function E(n) = En##n eventually dominates all primitive recursive functions. In fact, in the fast-growing hierarchy, \\(n \\mapsto E100\\#\\#n\\) dominates \\(f_n\\) for all \\(n < \\omega\\) and is itself dominated by \\(f_\\omega\\). E# and xE# form part of a larger notation, the Extensible-E System, that also encompasses Cascading-E Notation. Nathan Ho and Wojowu proved termination for the rules of Hyper-E Notation."@en . . . . "\\omega^{\\omega}"@en . . . "hyperion marks"@en . "\\omega"@en . .