Is the Shakespeare Programming Language Turing complete? 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.
In that page, the snippet

Juliet:
 Am I better than you?

Hamlet:
 If so, let us proceed to scene III.


essentially means

if (Juliet &gt; Hamlet) goto Scene III


This can be used to implement while loops. In pseudo syntax:

Scene II:
if (Juliet &gt; Hamlet) goto Scene III
... some statements here
goto Scene II
Scene III:
... more statements here


is essentially equivalent to

while (Juliet &lt;= Hamlet) {
   ... some statements here
}
... more statements here