We formulate recursive characterizations of the class of elementary functions and the class of functions computable in polynomial space that do not require any explicit bounded scheme. More specifically, we use functions where the input variables can occur in different kinds of positions ?normal and safe? in the vein of the Bellantoni and Cook's characterization of the polytime functions.
@article{urn:eudml:doc:44242,
title = {New recursive characterizations of the elementary functions and the functions computable in polynomial space.},
journal = {Revista Matem\'atica de la Universidad Complutense de Madrid},
volume = {10},
year = {1997},
pages = {109-125},
zbl = {0872.03028},
mrnumber = {MR1452566},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:44242}
}
Oitavem, I. New recursive characterizations of the elementary functions and the functions computable in polynomial space.. Revista Matemática de la Universidad Complutense de Madrid, Tome 10 (1997) pp. 109-125. http://gdmltest.u-ga.fr/item/urn:eudml:doc:44242/