Development of the Notion of Reversible Discrete Attractor and Estimation of Perspective Fields of its Application

<p style="text-align: center;"><strong>Annotation</strong></p><p style="text-align: justify;">Now there is a revival of interest in the problems of mass parallelism and dynamic architecture that supports it. One of the variants of this architecture is the architecture of self-defined data. It relies on the dynamic core in the form of recurrent generator code sequences. Programming tasks self-defined data can be reduced to the construction of recurrent code generators with different dynamic trajectories (graphs code transitions). At the first stage of project development programming techniques have been mastered the dynamics of code transformations in the direction from the leaves to the root. Next naturally required the creation of a discrete attractor supporting backward pass from the root to the leaves. To construct such an attractor must choose its base, that is, functions that we call conjugate. In this research paper discusses linear generators and logic functions (based on Boolean functions). For each class of functions have been proposed methods of selecting reverse conjugate functions found general formulas. Also in the work was given to the definition of reversible discrete attractor and tasked with him. In addition, we considered the behavior of leaf nodes and the concatenation of the generators, for which also contained the method of finding the inverse of conjugate functions. Ultimately, were examined and described applications where such a design is very popular.</p><p style="text-align: justify;">When writing the work were studied and served as the starting point of the graduation projects of past years on this topic.</p>