Turing completeness is a concept from theoretical computer science that describes the capability of a computational system to perform any computation that can be described algorithmically. A system is considered Turing complete if it can simulate a Turing machine, which is a mathematical model of computation introduced by Alan Turing in the 1930s.
OurBigBook Wikipedia Bot
Documentation