What's fascinating IMO is the realization that being able to compute anything needs very little requirements, that more complex models of machines, way different or with "obvious" improvements like more tapes, symbols or random access can't actually do more, but only hope that implementations end up being faster despite having more complex steps.

This is why you see some "shitty" esoteric programming languages where you think that nothing useful can be done, like Brainfuck end up being Turing-complete. The same is true for logic circuits, alone NOT, AND and OR are sort of useless, but get NOT and another one and now you can start building anything. Even some board games are Turing-complete, probably MtG is not the simplest example, but I bet there's a bunch of other ones that I don't know about.