This is a preview of subscription content, log in via an institution to check access.
Literature cited
R. I. Freidzon, “A definition of recursive-predicate complexity which does not depend on the standardization of the concept of algorithm,” Seminars in Mathematics, Vol. 8, Consultants Bureau, New York (1970), pp. 110–114.
D. R. Morrison, “A feasible library automaton,” Internat. Congr. Mathematicians, Abstracts of Short Communications (Sec. I), Moscow (1966), p. 10.
Additional information
The results of this article were reported at the Leningrad Seminar on Constructive Mathematics on May 15, 1969.
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Institute im. V. A. Steklova Akademii Nauk SSSR, Vol. 20, pp. 104–114, 1971.
Rights and permissions
About this article
Cite this article
Matiyasevich, Y.V. Real-time recognition of the inclusion relation. J Math Sci 1, 64–70 (1973). https://doi.org/10.1007/BF01117471
Issue Date:
DOI: https://doi.org/10.1007/BF01117471