Bounded iteration and unary functions
Stefano Mazzanti · Mathematical logic quarterly · 2004
Abstract The set of unary functions of complexity classes defined by using bounded primitive recursion is inductively characterized by means of bounded iteration. Elementary unary functions, linear space computable unary functions and polynomial space computable unary functions are then inductively characterized using only composition and bounded iteration. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)