Ability of a computing system to simulate Turing machines
Also known as Turing complete · computationally universal
10 statements · 30% with external sources · numbers in brackets are citations
5 identifiers linking Turing completeness across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. This means that this system is able to recognize or decode other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete.