I was reading about tge Turing machine. I also came across with the
Shakespeare programming language. After trying to understand the basics of the PL, I thought that it must be non-Turing complete. On some page I found out that I was wrong and
Shakespeare is actually "turing complete".
I didn't find how can I create while loops or recursive calls in
Shakespeare so I can't understand why it us Turing complete.
Will be glad for some explanation.