**RESEARCH ABSTRACT CELLULAR AUTOMAT INDEPENDENT OF TIME**

**UDC 519.713.1**

**doi: 10.26102/2310-6018/2019.24.1.037**

A.A. Umanov

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.

**Keywords: **:cellular automaton, rule, state, superposition, space, time, matrix.

**Full text:**

Umanov_1_19_1.pdf