+The Hardy hierarchy classifies the growth rate of [computable functions](/wiki/computable_function) using [transfinite ordinals](/wiki/transfinite_ordinal). It offers a precise framework for understanding the bounds and complexity within computability theory.
+## See also
+- [Ordinal Number](/wiki/ordinal_number)
+- [Fast-growing Hierarchy](/wiki/fast-growing_hierarchy)
+- [Recursion Theory](/wiki/recursion_theory)