Touring-complete

can someone please define Touring-complete before this shit goes any further.

In computability theory, an abstract machine or programming language is called Turing complete, Turing equivalent, or (computationally) universal if it has a computational power equivalent to (i.e., capable of emulating) a simplified model of a programmable computer known as the universal Turing machine. Being equivalent to the universal Turing machine essentially means being able to perform any computational task – though it does not mean being able to perform such tasks efficiently, quickly, or easily.

The term derives from the name of mathematician Alan Turing who introduced the model of the universal Turing machine.

Examples of Turing complete languages include C, C++ and Python.