- 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 mathematician and computer scientist Alan Turing. ← Wikipedia
- Related terms: Natural language processing, Rule, GIMP
- Previous term: Turbopack
- Next term: Tweening
- Random term: Document Structure Description (webglossary.info/random 🎲)