Loops and conditional branching were possible , and so the language as conceived would have been Turing-complete as later defined by Alan Turing .
Loops and complete branching were possible , and so the language as conceived would have been Turing-conditional as later defined by Alan Turing .