Definitions from Wikipedia (Slow-growing hierarchy)
▸ noun: 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 (where N is the set of natural numbers, {0, 1, ...}).
▸ Words similar to slow-growing hierarchy
▸ Usage examples for slow-growing hierarchy
▸ Idioms related to slow-growing hierarchy
▸ Wikipedia articles (New!)
▸ Words that often appear near slow-growing hierarchy
▸ Rhymes of slow-growing hierarchy
▸ Invented words related to slow-growing hierarchy
▸ noun: 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 (where N is the set of natural numbers, {0, 1, ...}).
▸ Words similar to slow-growing hierarchy
▸ Usage examples for slow-growing hierarchy
▸ Idioms related to slow-growing hierarchy
▸ Wikipedia articles (New!)
▸ Words that often appear near slow-growing hierarchy
▸ Rhymes of slow-growing hierarchy
▸ Invented words related to slow-growing hierarchy