Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
Yu. T. Medvedev, “Complexity degrees of mass problems,” Dokl. AN SSSR,104, No. 4, 501–504 (1955).
A. A. Muchnik, “Unsolvability of the convergence problem of the theory of algorithms,” Dokl. AN SSSR,108, No. 2, 194–197 (1956).
A. A. Muchnik, “On reducibility of decision problems for enumerable sets to separation problems,” Izv. AN SSSR, Ser. Matem.,29, No. 3, 717–724 (1965).
V. A. Uspenskii, Lectures on Computable Functions, Moscow (1960).
Y. Suzuki, “Enumeration of recursive sets,” J. of Symb. Logic,24, No. 4, 311 (1959).
R. M. Friedberg, “Three theorems on the recursive enumeration,” J. of Symb. Logic,23, No. 3, 309–318 (1958).
Liu Shin-Chao, “An enumeration of the primitive recursive functions without repetition,” Tohoku Math. J.,12, No. 3, 400–402 (1960).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 5, No. 2, pp. 261–267, February, 1969.
The author is deeply indebted to V. A. Uspenskii for discussion of the results.
Rights and permissions
About this article
Cite this article
Dushskii, V.A. Extension of partial recursive functions and functions with a recursive graph. Mathematical Notes of the Academy of Sciences of the USSR 5, 158–161 (1969). https://doi.org/10.1007/BF01098317
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01098317