Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Slow-growing hierarchy
open-in-new
<p>In <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>, <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a> and <a href="/facts/Proof_theory/kopBdQn9">proof theory</a>, the slow-growing hierarchy is an ordinal-indexed family of slowly increasing functions <i>g</i>α: N → N (where N is the set of <a href="/facts/Natural_numbers/u65og8JE">natural numbers</a>, {0, 1, ...}). It contrasts with the <a href="/facts/Fast-growing_hierarchy/4ctDqlLY">fast-growing hierarchy</a>. </p>