I'm pretty sure it doesn't.

But, if a computer can meet these requirements, then it will be turing complete:

"To show that something is Turing-complete, it is enough to show that it can be used to simulate some Turing-complete system. For example, an imperative language [a language that changes a program's state with terms] is Turing-complete if it has conditional branching (e.g., "if" and "goto" statements, or a "branch if zero" instruction; see one-instruction set computer) and the ability to change an arbitrary amount of memory (e.g., the ability to maintain an arbitrary number of data items). Of course, no physical system can have infinite memory; but if the limitation of finite memory is ignored, most programming languages are otherwise Turing-complete." (Wikipedia)