Extension of partial recursive functions and functions with a~recursive graph
Matematičeskie zametki, Tome 5 (1969) no. 2, pp. 261-267.

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

It is proved that every degree of complexity of mass problems, containing the decision problem of a recursive enumerable set, contains also the problem of extension of a partial recursive function, the graph of which is recursive. Some properties of functions with a recursive graph are considered.
@article{MZM_1969_5_2_a13,
     author = {V. A. Dushskii},
     title = {Extension of partial recursive functions and functions with a~recursive graph},
     journal = {Matemati\v{c}eskie zametki},
     pages = {261--267},
     publisher = {mathdoc},
     volume = {5},
     number = {2},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1969_5_2_a13/}
}
TY  - JOUR
AU  - V. A. Dushskii
TI  - Extension of partial recursive functions and functions with a~recursive graph
JO  - Matematičeskie zametki
PY  - 1969
SP  - 261
EP  - 267
VL  - 5
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1969_5_2_a13/
LA  - ru
ID  - MZM_1969_5_2_a13
ER  - 
%0 Journal Article
%A V. A. Dushskii
%T Extension of partial recursive functions and functions with a~recursive graph
%J Matematičeskie zametki
%D 1969
%P 261-267
%V 5
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1969_5_2_a13/
%G ru
%F MZM_1969_5_2_a13
V. A. Dushskii. Extension of partial recursive functions and functions with a~recursive graph. Matematičeskie zametki, Tome 5 (1969) no. 2, pp. 261-267. http://geodesic.mathdoc.fr/item/MZM_1969_5_2_a13/