Definitions from Wikipedia (Fast-growing hierarchy)
▸ noun: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg-Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).
▸ Words similar to Fast-growing hierarchy
▸ Usage examples for Fast-growing hierarchy
▸ Idioms related to Fast-growing hierarchy
▸ Wikipedia articles (New!)
▸ Words that often appear near Fast-growing hierarchy
▸ Rhymes of Fast-growing hierarchy
▸ Invented words related to Fast-growing hierarchy
▸ noun: In computability theory, computational complexity theory and proof theory, a fast-growing hierarchy (also called an extended Grzegorczyk hierarchy, or a Schwichtenberg-Wainer hierarchy) is an ordinal-indexed family of rapidly increasing functions fα: N → N (where N is the set of natural numbers {0, 1, ...}, and α ranges up to some large countable ordinal).
▸ Words similar to Fast-growing hierarchy
▸ Usage examples for Fast-growing hierarchy
▸ Idioms related to Fast-growing hierarchy
▸ Wikipedia articles (New!)
▸ Words that often appear near Fast-growing hierarchy
▸ Rhymes of Fast-growing hierarchy
▸ Invented words related to Fast-growing hierarchy