{'fraction_non_alphanumeric': 0.023668639053254437, 'fraction_numerical': 0.004733727810650888, 'mean_word_length': 5.714285714285714, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Computation of disordered Boolean functions

One of the promising directions in complex control and data processing system design is the development of specialized processors for large data arrays and the modeling of complex systems executing in parallel, and simultaneously complex operations (including the fast Fourier transform, numerical signal filtration, computation of the correlation function, vector-matrix transformations etc.) in real time. The nonrecurrent Boolean functions were classified by Shidlovskiy et al. (2001), where multifunctional logic modules (MLM) realizing ordered Boolean functions from the given class were also described. By MLM (module) is meant an adjustable automaton whose output values depend only on the values of its input signals. The present work describes an MLM for computation of disordered functions.