1 Answers
In computability theory, computational complexity theory and proof theory, the slow-growing hierarchy is an ordinal-indexed family of slowly increasing functions gα: N → N. It contrasts with the fast-growing hierarchy.
4 views
Answered