{'fraction_non_alphanumeric': 0.037914691943127965, 'fraction_numerical': 0.018957345971563982, 'mean_word_length': 4.423076923076923, '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}}
Rule 110: universality and catenations

Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has proved than even one of the simplest cellular automata can embed any Turing computation. In this paper, we give a new high-level version of this proof using particles and collisions as introduced in [10].