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
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1968_8_a24/
LA  - ru
ID  - ZNSL_1968_8_a24
ER  -