Библиография Лаврова И.А.

Machtey M. [1974] The honest subrecursive classes are a lattice Inform. and Control, 24, № 3, 247-263 74.09.67 O article Вернуться к поиску

Machtey M. [1971] Admissible ordinals and lattice of α-R.E. sets Ann. Math. Logic, 2, № 4, 379-417 71.10.21 article Вернуться к поиску

Machtey M., Young P.R. [1978] An introduction to the general theory of algorithms Elsevier, North-Holland, Amsterdam, N.Y. ? S book Вернуться к поиску

Machtey M. [1976] Minimal pairs of polynomial degrees with subexponential complexity Theor. Comput. Sci., 2, № 1, 73-76 77.01.45 O article Вернуться к поиску

Machtey M. [1975] On the density of honest subrecursive classes J. Comp. and System Sci., 10, № 2, 183-199 75.12.55 O article Вернуться к поиску

Machtey M., Winklmann K., Young P.R. [1978] Simple Gödel numberings, isomorphisms, and programming properties SIAM J. Comp., 7, № 1, 39-60 78.В11.1084 O article Вернуться к поиску

Machtey M. [1975] Helping and the meet of pairs of honest subrecursive classes Inform. and Control, 28, № 1, 76-89 75.В11.432 O article Вернуться к поиску

M Maass W. Mac Queen D. Machover M. Machtey M. MacintyreA MacIntyreJM Madan D.B. Mahaney S.R. Mahn F.K. Maier W. Mainhardt G. Maksimova L. L. Malcev A.I. Manasse M. Manaster A. B. Marandzjan G. B. Marcone A. Marker D. Marques I. MartinDA MartinG Matiyasevich Yu.V. Mayoh B.H. McCarthyC McCarthyJ ...