The game for those who are new to it — well worth playing!
If you look at it with the perspective of an artist, it's absolutely glorious
I think there is enough space in the world for both (as long as they don't get mixed up at the wrong moment). See also Daniel Temkin's "The Less Humble Programmer"
A mechanical bf interpreter in Opus Magnum. Self modifying code hell appears to result in a much more compact machine... at the cost of sanity.
(baba is you is an amazingly elegant game)
Don't play this sitting on the toilet though, it's going to be a long toilet session
Is there a name for the thing where you generalise something to be an infinite version of itself, then show that that infinite version is Turing complete, then transfer that back to the original finite thing? Sort of like we are willing to call real physical computers 'Turing complete' despite them clearly not having infinite memory.
No finite state machine is strictly Turing-complete, but the category of those that would be, but for the resource limitation, is an extremely useful one.
Every finite physical machine is limited in different way, so it doesn't make much sense to try to lump them together. Whereas every Turing-complete machine is equivalent.
That being said, I'm a little curious as to why one would want to prove something is Turing complete. I tend to assume something is Turing complete unless shown otherwise. For instance, I would never have gambled MTG wasn't Turing complete.
One case where Turing completeness was useful was in proving wrong those programmers who claimed that there were some programs that just could not be written using structured programming. Also, if we did not know about Turing completeness, there would be constant futile research trying to find alternative architectures and languages that could solve problems that cannot be solved with what we have.