Literature Cited
J. von Neumann, Theory of Self-Reproducing Automata, University of Illinois Press (1966).
A. Turing, Can Machines Think? [Russian translation], Fizmatgiz, Moscow (1960).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, “Theory of language processors and parallel computations,” Kibernetika, No. 1, 1–19 (1979).
É. V. Evreinov and Yu. G. Kosarev, Uniform Universal Computing Systems of High Efficiency [in Russian], Nauka, Novosibirsk (1966).
V. A. Trakhtenbrot, Algorithms and Computing Automata [in Russian], Sov, Radio, Moscow (1974).
O. L. Bandman, É. V. Evreinov, V. V. Korneev, and V. G. Khoroshevskii, “Uniform computing system based on large integrated circuits,” Vychisl. Sist., No. 70, 3–28 (1977).
V. E. Kotov, “Theory of parallel programming: applied aspects,” Kibernetika, No. 1, 1–16; No. 2, 1–18 (1974).
N. N. Mirenkov, “Parallel algorithms for solution of problems on uniform computing systems,” Vychisl. Syst., No. 57, 3–32 (1973).
A. V. Shileiko, Theory and Principles of Construction of Computing Systems with Programmable Structure [in Russian], Doctoral Dissertation (1972).
É. V. Evreinov, I. A. Mamzelev, V. V. Antonov, M. Yu. Artem'ev, et al., “Concentrated uniform computing complex ‘Kollektiv,’” in: Prospectus of Exhibition of National Economic Achievements of the USSR [in Russian] (1980).
M. Yu. Artem'ev, “Functional completeness of exchange operations in uniform computing systems,” in: Abstracts of Reports Presented at Third Republican Conference on “Parallel Machines and Parallel Mathematics” [in Russian], Kiev (1980), pp. 54–55.
Additional information
Translated from Kibernetika, No. 3, pp. 84–89, May–June, 1981.
Rights and permissions
About this article
Cite this article
Mamzelev, I.A., Artem'ev, M.Y. Algorithmically complete set of system operations of uniform computing systems (UCS) with common main channel. Cybern Syst Anal 17, 384–389 (1981). https://doi.org/10.1007/BF01068983
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068983