Hardy hierarchy

The Hardy hierarchy is a classification of certain functions based on their growth rates. It is particularly relevant in the context of mathematical logic and computability theory. The functions in the Hardy hierarchy are often denoted as \( f_\alpha(n) \) for ordinals \( \alpha \). The basic idea is to categorize functions into levels based on how they grow.