Publication Date:
2005
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.
Iris type:
1.1 Articolo su Rivista
Keywords:
Bounded iteration; elementary functions; linear space computable functions; polynomial space computable functions.
List of contributors:
Mazzanti, Stefano
Published in: