Geodesic
Constructive models of infinite algorithmic complexity
Doklady Akademii Nauk, Tome 335 (1994) no. 2, pp. 135-137.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1994_335_2_a1,
     author = {Yu. G. Ventsov},
     title = {Constructive models of infinite algorithmic complexity},
     journal = {Doklady Akademii Nauk},
     pages = {135--137},
     publisher = {mathdoc},
     volume = {335},
     number = {2},
     year = {1994},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1994_335_2_a1/}
}
TY  - JOUR
AU  - Yu. G. Ventsov
TI  - Constructive models of infinite algorithmic complexity
JO  - Doklady Akademii Nauk
PY  - 1994
SP  - 135
EP  - 137
VL  - 335
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1994_335_2_a1/
LA  - ru
ID  - DAN_1994_335_2_a1
ER  - 
%0 Journal Article
%A Yu. G. Ventsov
%T Constructive models of infinite algorithmic complexity
%J Doklady Akademii Nauk
%D 1994
%P 135-137
%V 335
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1994_335_2_a1/
%G ru
%F DAN_1994_335_2_a1
Yu. G. Ventsov. Constructive models of infinite algorithmic complexity. Doklady Akademii Nauk, Tome 335 (1994) no. 2, pp. 135-137. http://geodesic.mathdoc.fr/item/DAN_1994_335_2_a1/