Any programminglanguage could be considered Turing complete given enough memory.
however
score: 3
"Programming language" needs to be well-defined. Some people explicitly exclude languages that are not Turing-complete, in which case the statement is tautological.