RESEARCH ABSTRACT CELLULAR AUTOMAT INDEPENDENT OF TIME

The relevance of the study is due to the increasing number of computing cores from a single computing device, and the total number of such devices. At the same time, many algorithms are designed to work in a strictly defined sequence, as a result, either part of the computing power is idle, or additional logic is added on top of the main calculations, which not only complicates the development, but also requires additional calculations, the only purpose of which is synchronization between nodes / cores / threads. In this regard, this article aims to identify how to perform calculations without the need for synchronization as such, using the example of the cellular automaton. The leading method for the study of this problem is the mathematical and computer simulation of the cellular automaton, which allows to comprehensively consider the root cause of the need to perform synchronization - time. The article presents a method of describing a cellular automaton, in which all unnecessary entities are excluded, one of which was time, as a result of which synchronization was no longer necessary. Key entities that are sufficient for a full description of the operation of an arbitrary cellular automaton are identified. The applicability of the minimum set of entities is justified by the example of an elementary one-dimensional cellular automaton. The materials of the article are of practical value for specialists in the field of mathematical modeling and information technology.

1. Simulation of quantum circuits on a virtual cellular automaton / Matveyeva I.V. - №5. - St. Petersburg: News of St. Petersburg State Electrotechnical University LETI, 2011. - 33-39P.

2. Adamson, N.N. Model "teacher-student" in the framework of the presentation of cellular automata, Bulletin of the Moscow State Regional University / N.N. Adamson, E.V. Kalashnikov. - №1. - Moscow: Bulletin of the Moscow State Regional University. Series: Physics and Mathematics, 2018. - 6-15P.

3. Mochalova, Y.D. Simulation of epidemics using a cellular automaton, in the collection: Modern Innovations: Theoretical and Practical View, a collection of scientific papers based on the materials of the VIII International Scientific and Practical Conference / Y.D. Mochalova. - Moscow: “Problems of Science”, 2018. - 12-13P

4. Vitvitsky, A.A. Cellular automata with a dynamic structure for modeling the growth of biological tissues / A.A. Vitvitsky. - volume 17. - Novosibirsk: Sib. journals computed Mat, 2014. - 315-327P.

5. Medvedev, Yu.G. Modeling the movement of a piston in a gas medium by a cellular automaton / Yu.G. Medvedev. - №4 (10).-Prikl. Mechanical Engineering, 2010.-100-108P.

6. Kucherenko, I.V. On solvability conditions for the reversibility of cellular automata / I.V. Kucherenko. - Volume 11, № 1-4. - Moscow: Intellectual systems, 2007. - 756-768P.

7. Titova, E.E. Construction of images by cellular automata. Titov. - Moscow: Mosk. state un-t them. Mv Lomonosova, 2015. - 105-122P

8. A New Kind of Sсienсe /Stephen Wolfram. — Wolfram Media, Inс, 2002. — 1197 P.

9. The fantastic Combinations of John Conway's new solitaire game "life" /Stephen Wolfram. — №4. — Scientific American, 1970. — 120-123 p.

10. Principles of quantum mechanics / Dirac P. А. М. - №4.-Moscow: Peace, 1979.–27P.

11. Mind and the World Order /Lewis, O. I. — New York: С. Scribner’s Sons, 1929. — 455 p.

12. Sylvester Matrix [Electronic resource] / Weisstein, Eric W. - Electron. text given. - Access mode: http://mathworld.wolfram.com/SylvesterMatrix.html, free.

13. The Hadamard Product [Electronic resource] / Million, Elizabeth. - Electron. text given. - 2007: Access Mode: http://mathworld.wolfram.com/SylvesterMatrix.html, free