The Hardy hierarchy is a certain hierarchy mapping ordinals \(\alpha\) to functions \(H_\alpha: \mathbb{N} ightarrow \mathbb{N}\). For large ordinals \(\alpha\), \(H_\alpha\) grows extremely fast. The Hardy hierarchy is named after G. H. Hardy, who first described it in his 1904 paper "A theorem concerning the infinite cardinal numbers". It is less known than its speedier cousin, the fast-growing hierarchy. However, it can on occasion be more useful than the fast-growing hierarchy; for example, it can more easily be related to the numbers resulting from Goodstein sequences.