?
Проблемы моделирования феномена самосборки (ч. I)
Long-term programs of technological development and prospects for the development of nature-friendly technologies require accelerated research and the creation of mathematical foundations for modeling the phenomenon of self-assembly. This article analyzes the facts of experimental observations of self-assembly phenomena and justifies the conclusion that self-assembly is the realization of algorithmic forms of behavior at the molecular level. It is known that algorithmic forms of behavior are generated by sign systems of certain types. The problem is that the sign systems that function in computer technology and the algorithmic dynamics generated by them do not correspond to the facts of self-assembly monitoring. The task of mathematical modeling of self-assembly is formulated as the development of specific sign systems that generate algorithmic dynamics adequate to the phenomenon of self-assembly. The article presents the foundations of discrete dynamics based on the concept of a discrete attractor. The possibilities and prospects for constructing mathematical models of self-assembly algorithms based on a discrete attractor are discussed.