About: dbkwik:resource/OUYNzGHvbcG_UcoAtwPzUQ==

Property	Value
rdfs:label	Hyper-E notation
rdfs:comment	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.
dcterms:subject	Functions Functions by Sbiis Saibian Notations
dbkwik:googology/property/wikiPageUsesTemplate	dbkwik:resource/3rZl5O1bsBDqsb2zRBdGQQ== dbkwik:resource/voUt_khWbL3WeOTRSK4M2g== dbkwik:resource/cGAjkhSUqwbQU9Yxi8kGsg== dbkwik:resource/8c4C4ngkS6f6DgtyRAPcYw== dbkwik:resource/IiI9orEQm0qrxJuKb9bRvA==
Name	Extended Hyper-E notation
fgh	\omega \omega^{\omega}
Base	Exponentiation hyperion marks
abstract	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.
is wikipage disambiguates of	E