Very much like (surely equivalent on some level) how very simple automata such as Rule 110 are Turing complete but the encoding schemes are Rube Goldberg machin

Very much like (surely equivalent on some level) how very simple automata such as Rule 110 are Turing complete but the encoding schemes are Rube Goldberg machines. An overview for Rule 110: https://cs.stackexchange.com/a/4780 https://cs.stackexchange.com/a/4780