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.