New recursive characterizations of the elementary functions and the functions computable in polynomial space.
Revista Matemática de la Universidad Complutense de Madrid (1997)
- Volume: 10, Issue: 1, page 109-125
- ISSN: 1139-1138
Access Full Article
topAbstract
topHow to cite
topOitavem, I.. "New recursive characterizations of the elementary functions and the functions computable in polynomial space.." Revista Matemática de la Universidad Complutense de Madrid 10.1 (1997): 109-125. <http://eudml.org/doc/44242>.
@article{Oitavem1997,
abstract = {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.},
author = {Oitavem, I.},
journal = {Revista Matemática de la Universidad Complutense de Madrid},
keywords = {Funciones elementales; Cálculo por ordenador; Espacios de funciones; Funciones polinómicas; Cálculo iterativo; Cálculo numérico; PSPACE; recursion-theoretic characterization; subrecursive function classes; elementary functions; polynomially space-computable functions; basis functions; composition; variants of recursion},
language = {eng},
number = {1},
pages = {109-125},
title = {New recursive characterizations of the elementary functions and the functions computable in polynomial space.},
url = {http://eudml.org/doc/44242},
volume = {10},
year = {1997},
}
TY - JOUR
AU - Oitavem, I.
TI - New recursive characterizations of the elementary functions and the functions computable in polynomial space.
JO - Revista Matemática de la Universidad Complutense de Madrid
PY - 1997
VL - 10
IS - 1
SP - 109
EP - 125
AB - 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.
LA - eng
KW - Funciones elementales; Cálculo por ordenador; Espacios de funciones; Funciones polinómicas; Cálculo iterativo; Cálculo numérico; PSPACE; recursion-theoretic characterization; subrecursive function classes; elementary functions; polynomially space-computable functions; basis functions; composition; variants of recursion
UR - http://eudml.org/doc/44242
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.