I was going to ask about what meets something being Turing Complete, because I remember when Hopscotch added conditionals and it was part of it being a Turing Complete language Which means it can be used to solve any problem in the world!! – given enough time and space.
Hehe this inspired me so much that I was trying to replicate the exponent function, modulo function, square root function in Hopscotch using only what was available (which was none of these functions themselves.)
I would have liked to ask what is a Turing complete system if it is any different. maybe there are more things that people know and might share