Definition
A concept named after English mathematician and computer scientist Alan Turing - a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be "Turing complete" or "computationally universal" if it can be used to simulate any Turing machine.
Note
Turing is always capitalized (proper noun from Alan Turing).
Translations
| Language | Prose |
|---|---|
| العربية Arabic | مكتملة تورنغ |
| বাংলা Bengali | টুরিং সম্পূর্ণ |
| Čeština Czech | turingovsky úplný |
| Deutsch German | Turing-vollständig |
| Español Spanish | Turing completos |
| Français French | Turing-complet |
| हिन्दी Hindi | ट्यूरिंग पूर्ण |
| Bahasa Indonesia Indonesian | lengkap Turing |
| Italiano Italian | Turing completo |
| 日本語 Japanese | チューリング完全な |
| 한국어 Korean | 튜링 완전한 |
| मराठी Marathi | ट्युरिंग पूर्ण |
| Polski Polish | kompletna w sensie Turinga |
| Português Portuguese (Brazil) | Turing completo |
| Русский Russian | тьюринг-полным |
| Kiswahili Swahili | kamilifu ki-Turing |
| தமிழ் Tamil | டியூரிங் முழுமையான |
| తెలుగు Telugu | ట్యూరింగ్ సంపూర్ణ |
| Türkçe Turkish | Turing tam |
| Українська Ukrainian | повною за Тюрінгом |
| اردو Urdu | ٹیورنگ مکمل |
| Tiếng Việt Vietnamese | Turing hoàn chỉnh |
| 简体中文 Chinese (Simplified) | 图灵完备 |
| 繁體中文 Chinese (Traditional) | 圖靈完備 |