APPROACHES TO CONFIRMING MUTUAL SYNCHRONIZATION IN TREE-LIKE PARITY MACHINES

Abstract

This paper presents the experimental results of comparing algorithms for confirming the completion of mutual synchronization using polynomial and hash functions. The approach based on the polynomial function was experimentally tested for resistance to failure. All experiments were performed on neural networks with an architecture that uses real numbers with float accuracy. As a result, the approach using the polynomial function was not sufficiently resistant to failure and does not exceed the approach using the hash function in speed. The tasks of further research are determined.