Turing Completeness/Complete - Computationally Universal
- in computability theory, a system of data-manipulation rules (such as a model of computation, a computer’s instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine
From UT MSDS Online
If it contains the following then it is Turing complete:
- assignment statements
- arithmetic
- conditionals
- loops