Hardy hierarchy

In computability theory, computational complexity theory and proof theory, the Hardy hierarchy, named after G. H. Hardy, is a hierarchy of sets of numerical functions generated from an ordinal-indexed family of functions hα: N → N called Hardy functions. It is related to the fast-growing hierarchy and slow-growing hierarchy.

This keyword could refer to multiple things. Here are some suggestions: