Abstract:This paper discusses the hierarchies of some classes of recursive functions. A simple equivalent definition of original Grzegorczyk's hierarchy is presented at first. Then the authors define by the generalization of Ackermann's function a sequence of recursive functions {An}n∈ω, based on which they define hierarchy, {Zn}n∈ω(the Z-hierarchy)of a class of recursive functions which is much larger than the class of primitive recursive functions.The first level Z0 of this hierarchy is just the class of primitive recursive functions.For all n, Zn+1 contains the universal function of its predecessor Zn. A refinement {Zni}n,i∈ωof Z-hierarchy is defined at last by the natural hierarchy of each Zn. The refinement on ZO is same as the original Grzegorczyk's hierarchy. This shows that their Z-hierarchy and its refinement are really a natural extension of Grzegorczyk's hierarchy.