Computability via Cellular Automata
- Авторы: Gavrilov S.V.1, Matyushkin I.V.2, Stempkovsky A.L.1
-
Учреждения:
- Institute for Design Problems in Microelectronics
- Research Institute for Molecular Electronics
- Выпуск: Том 44, № 5 (2017)
- Страницы: 314-328
- Раздел: Article
- URL: https://journals.rcsi.science/0147-6882/article/view/175276
- DOI: https://doi.org/10.3103/S0147688217050057
- ID: 175276
Цитировать
Аннотация
This review addresses the issues of computations using cellular automata (CA). It is shown that the generality of the connectionism paradigm allows some methods applicable to neural networks to be transferred into the domain of CA. Some special issues of computability are discussed based on the examples of the density classification task, the firing-squad synchronization problem, and the queen-bee problem, as well as sorting algorithms and Atrubin’s parallel multiplication algorithm.
Об авторах
S. Gavrilov
Institute for Design Problems in Microelectronics
Автор, ответственный за переписку.
Email: Sergey.V.Gavrilov@ippm.ru
Россия, Moscow, 124460
I. Matyushkin
Research Institute for Molecular Electronics
Email: Sergey.V.Gavrilov@ippm.ru
Россия, Moscow, 124681
A. Stempkovsky
Institute for Design Problems in Microelectronics
Email: Sergey.V.Gavrilov@ippm.ru
Россия, Moscow, 124460
Дополнительные файлы
