Voir la notice de l'article provenant de la source Numdam
@article{ITA_1987__21_2_175_0, author = {Tor\'an, Jacobo}, title = {On the complexity of computable real sequences}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {175--180}, publisher = {EDP-Sciences}, volume = {21}, number = {2}, year = {1987}, mrnumber = {894709}, zbl = {0634.68032}, language = {en}, url = {http://geodesic.mathdoc.fr/item/ITA_1987__21_2_175_0/} }
TY - JOUR AU - Torán, Jacobo TI - On the complexity of computable real sequences JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1987 SP - 175 EP - 180 VL - 21 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1987__21_2_175_0/ LA - en ID - ITA_1987__21_2_175_0 ER -
%0 Journal Article %A Torán, Jacobo %T On the complexity of computable real sequences %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1987 %P 175-180 %V 21 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1987__21_2_175_0/ %G en %F ITA_1987__21_2_175_0
Torán, Jacobo. On the complexity of computable real sequences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 2, pp. 175-180. http://geodesic.mathdoc.fr/item/ITA_1987__21_2_175_0/