[kazinator]

Your comment seems as if it might be confusing Turing completeness with the expressiveness of the actual machines described in Turing's work.

> A Turing machine is not "so simple that it can run any any program ...".

Simplicity has nothing to do with it. Turing showed that some very simple machines can calculate recursive functions.

Not every machine that is Turing Complete looks like a tape machine from Turing's papers.

> it's no fun writing code for a Turing machine

Almost every general-purpose programming language is a Universal Turing Machine; so that's like saying it's not fun to write code, period.