A program is Turing complete if it can simulate any Turing machine. For some reason this boilds down to having: Ifs Loops