Abstract
A three-dimensional associative parallel processor (APP3) is introduced and a program without loops and jumps is developed which for every algorithmically computable function 1) computes the function given a finite but sufficiently large memory, dependent on the function and the argument, 2) recognizes the domain of its definition on infinite memory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
G. M. Popova and I. V. Prangishvili, “An associative parallel processor for group data processing,” Avtomat. Telemekh., No. 1, 171–184 (1972).
I. V. Prangishvili (ed.), Homogeneous IC Associative Processors [in Russian], Sovet-skoe Radio, Moscow (1973).
V. N. Aleeva and Ya. I. Fet, “An associative processor for large-block information processing,” in: Optimization [in Russian], No. 15(32). Novosibirsk (1974), pp. 154–177.
Y. Chu, Computer Organization and Microprogramming [Russian translation], Mir, Moscow (1975).
A. S. Narin'yani, “Theory of parallel programming. Formal models,” Kibernetika, No. 3, 1–15 (1974).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 70, pp. 140–160, 1977.
In conclusion, I would like to acknowledge the helpful comments of K. V. Shakhbazyan.
Rights and permissions
About this article
Cite this article
Lebedinskii, M.M. Feasibility of parallel computations on a three-dimensional associative parallel processor. J Math Sci 23, 1979–1996 (1983). https://doi.org/10.1007/BF01093279
Issue Date:
DOI: https://doi.org/10.1007/BF01093279