{'fraction_non_alphanumeric': 0.01340033500837521, 'fraction_numerical': 0.0, 'mean_word_length': 4.805825242718447, '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}}
Evolutionary heuristics for automatic discoveries of cellular automata simulating AND gates

We aim to construct an automatic system for the discovery of Turing-universal cellular automata. A new step toward this automatic system, presented in this paper, is an automatic method of detection of cellular automata simulating AND gates. The heuristics of the search for these cellular automata is to search for a glider, then to search for a gun emitting this glider and then to search for a simulation of an AND gate. Results show how a large number of simulations of logic gates can be discovered.