|
Matematicheskie Zametki, 1969, Volume 5, Issue 2, Pages 261–267
(Mi mzm6831)
|
|
|
|
Extension of partial recursive functions and functions with a recursive graph
V. A. Dushskii Moscow Institute of Electronic Engineering
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.
Received: 15.12.1967
Citation:
V. A. Dushskii, “Extension of partial recursive functions and functions with a recursive graph”, Mat. Zametki, 5:2 (1969), 261–267; Math. Notes, 5:2 (1969), 158–161
Linking options:
https://www.mathnet.ru/eng/mzm6831 https://www.mathnet.ru/eng/mzm/v5/i2/p261
|
Statistics & downloads: |
Abstract page: | 437 | Full-text PDF : | 186 | First page: | 1 |
|