So does every Turing-complete language with non-termination. Type systems are decidable and thus cannot, by definition, rule out all errors. Instead, they look

So does every Turing-complete language with non-termination. Type systems are decidable and thus cannot, by definition, rule out all errors. Instead, they look at a subset of possible errors. This subset is provably eliminated from valid code. "Dynamically typed" languages reduce that subset to the empty set.