- A system of data manipulation rules (such as a computer’s instruction set, a programming language, or a cellular automaton) that can be used to simulate any Turing machine. This means that this system is able to recognize or decide 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. The concept is named after English mathematician and computer scientist Alan Turing. ← Wikipedia
- More about this term (beta): Web search, articles and videos, books
- Previous term: Turbo pages
- Next term: Two-factor authentication
- Random term: .NET Framework