О классах алгоритмов, сохраняющих отношения
Veroâtnostnye metody i kibernetika, Tome 18 (1982), pp. 26-36
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
algorithmic completeness, completeness problem, systems of algorithmic algebras of graph-schemes of algorithms with memory, maximal subalgebras of precomplete classes
@article{VMK_1982__18_69207,
author = {{\CYRYU}.{\CYRV}. {\CYRG}{\cyro}{\cyrl}{\cyru}{\cyrn}{\cyrk}{\cyro}{\cyrv}},
title = {{\CYRO} {\cyrk}{\cyrl}{\cyra}{\cyrs}{\cyrs}{\cyra}{\cyrh} {\cyra}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm}{\cyro}{\cyrv}, {\cyrs}{\cyro}{\cyrh}{\cyrr}{\cyra}{\cyrn}{\cyrya}{\cyryu}{\cyrshch}{\cyri}{\cyrh} {\cyro}{\cyrt}{\cyrn}{\cyro}{\cyrsh}{\cyre}{\cyrn}{\cyri}{\cyrya}},
journal = {Vero\^atnostnye metody i kibernetika},
pages = {26--36},
year = {1982},
volume = {18},
zbl = {0545.68024},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMK_1982__18_69207/}
}
Ю.В. Голунков. О классах алгоритмов, сохраняющих отношения. Veroâtnostnye metody i kibernetika, Tome 18 (1982), pp. 26-36. http://geodesic.mathdoc.fr/item/VMK_1982__18_69207/