Turing Completeness

Both language $1$ and $2($shown below$)$ are Turing complete in the sense that they can be used to describe all the

computations that a Turning machine can perform.