[Rick]

this has a pretty good definition of what a Turing Complete language is. And informal isn't wrong, especially since this is a programming challenge, not mathematics.

Kind of off-topic, but true turing completeness is achievable with quantum computers, as even 1 qubit can be used to solve any algorithm, if measured accurately enough.

Regardless, this isn't the purpose of the thread. If you want to discuss what is and isn't turing complete, make a thread in academic discussion.

But still, isn't any programming language that can do a selection and store data already a Turing complete language?