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

Meyer A.R., Winklmann K. [1979] The fundamental theorem of complexity theory Found. Comput. Sci., 3, 97-112 ? O article Вернуться к поиску

Meyer A.R., Fischer M.J. [1972] Computational speed-up by effective operators J. Symbolic Logic, 37, № 1, 55-68 73.01.67; O article Вернуться к поиску

Lynch N.A., Meyer A.R., Fischer M.J. [1972] Prioity arguments in complexiy theory Recursive Function Theory Newsletter, 2, 7-10 ? article Вернуться к поиску

Meyer A.R., McCreight E.M. [1969] Classes of computable functions defined by bounds of computations Proc. Symp. Theoret. Comput., 1, 79-88 ? O article Вернуться к поиску

Meyer A.R., Ritchie D.M. [1972] A classification of the recursive functions Z. math. Logik und Grundl. Math., 18, № 1, 71-82 72.12.56 O article Вернуться к поиску

Moll R., Meyer A.R. [1974] Honest bounds for complexity classes of recursive functions J. Symbolic Logic, 39, № 1, 127-138 75.02.93 O article Вернуться к поиску

Helm J.P., Meyer A. R., Young P. R. [1973] On orders of translations and enumerations Pacif. J. Math., 46, № 1, 185-195 74.01.97 article Вернуться к поиску

Lynch N.,Meyer A.R.,Fischer M.J. [1976] Relativization of the theory of computational complexity Trans. Amer. Math. Soc., 220, 243-287 77.04.52 article Вернуться к поиску

Meyer A.R., McCreight E.M. [1971] Computationally complex and pseudorandom zero-one valued functions Theory of Machines and Computations, Academic Press, New York, 19-42 73.06.88 article Вернуться к поиску

.... MartinDA MartinG Matiyasevich Yu.V. Mayoh B.H. McCarthyC McCarthyJ McCoy Ch.F.D. McCreight E.M. McEvoy K. McKenzie R. McKinsey J. C. C. McLaughlin T.G. McNicholl T. H. McNulty G. Melhorn K. Melzak Z.A. Mendelson E. Menzel W. Merkle W. Metakides G. MeyerAR Mihailovich N. J. Mileti J.R. MillarRC MillarTS MillerD MillerJS MillerRG MillerS MillerW Mills C.F. Minsky M.L. Mitchell R. Moggi E. Moh Shaw-kwei Mohrherr J. Moldestad J. Moll R. Monk J.D. Montagna F. Montalban A. MooreD MooreEF Morley M.D. ...