Yep, because just about all modern computer languages could be used to write a simulation of Turing's original imaginary "endless paper tape" computer he dreamed up in the 1930s.  Turing's simple example, though, was very impressive because he was dreaming about computers before anybody had any idea how a computer could actually work.

Two conclusions to think about.

First, if a group is actually babbling out loud about "Turing completeness" in a world where just about all programming languages are Turing complete, it's because they want you to think they are smart and have a monopoly on something special when they really don't.

Second, if nearly all programming languages are Turing complete, go with (and back for further development) the language that is actually simplest to use.   Which for side chains and dapps is JavaScript with Lisk, not Solidity with Etherium.