Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Grzegorczyk hierarchy
open-in-new
<p>The Grzegorczyk hierarchy , named after the Polish logician <a href="/facts/Andrzej_Grzegorczyk/YIW9k7Dt">Andrzej Grzegorczyk</a>, is a hierarchy of functions used in <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>. Every <a href="/facts/Function_(mathematics)/CdReEKCh">function</a> in the Grzegorczyk hierarchy is a <a href="/facts/Primitive_recursive_function/4z97gRnl">primitive recursive function</a>, and every primitive recursive function appears in the hierarchy at some level. The hierarchy deals with the rate at which the values of the functions grow; intuitively, functions in lower levels of the hierarchy grow slower than functions in the higher levels. </p>