Talk:Λλλ

This isn't really faithful to what you wanted, I would guess, but in theory, the language could interpret the bytes of that code block as binary bits, where 0 means switch the instruction and 1 means execute (turning tarpit). Populate with enough instructions and it's Turing-complete. Then, make a lot of the commands just "steps to setting up a Rule 110 interpreter", not necessarily even real steps, just that using them in a specific order results in throwing away the remaining code and executing Rule 110 on input. As for self-modifying, that doesn't need to be a part of the Rule 110 interpreter by your rules, and even if you meant to require that, just make the first 1 bit flip a 0 to a 1 somewhere. A version more in the spirit of things would be much harder, and would require extensive analysis of both the program provided and the inner workings of a Rule 110 interpreter. BoundedBeans (talk) 09:44, 2 March 2025 (UTC)