Turing completeness (图灵完备 tú líng wánbèi) is used as a way to express the power of a data-manipulation rule set. A system of data-manipulation rules (e.g. computer’s instruction set or a programming language) is Turing complete or computationally universal if it can function as a Turing machine. It means that this system is able to recognize or decide other data-manipulation rule sets.
Part 1: Breakdown of Words
- “图灵” (tú líng) is the transliteration of Alan Mathison Turing, a British computer scientist and mathematician, provides formalized concepts of algorithm and computation with the Turing machine which is used to decide formal languages and solve mathematical functions.
- Completeness (完备 wán bèi) as in “system completeness” (系统完备性 xì tǒng wán bèi xìng).