Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 225-233
Citer cet article
R. I. Freidson. A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part II, Tome 8 (1968), pp. 225-233. http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a24/
@article{ZNSL_1968_8_a24,
author = {R. I. Freidson},
title = {A~complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {225--233},
year = {1968},
volume = {8},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a24/}
}
TY - JOUR
AU - R. I. Freidson
TI - A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm
JO - Zapiski Nauchnykh Seminarov POMI
PY - 1968
SP - 225
EP - 233
VL - 8
UR - http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a24/
LA - ru
ID - ZNSL_1968_8_a24
ER -
%0 Journal Article
%A R. I. Freidson
%T A complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm
%J Zapiski Nauchnykh Seminarov POMI
%D 1968
%P 225-233
%V 8
%U http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a24/
%G ru
%F ZNSL_1968_8_a24
