Turing completeness (Q688)
Jump to navigation
Jump to search
measure of the ability of a theoretical computing system to simulate a Turing machine (Turing complete and Turing incomplete are only possible outcomes)
- Turing complete
- computationally universal
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turing completeness |
measure of the ability of a theoretical computing system to simulate a Turing machine (Turing complete and Turing incomplete are only possible outcomes) |
|
Statements
Sitelinks
Miki(0 entries)
Wikipedia(29 entries)
- arwiki كمال تورنغ
- bgwiki Цялостност по Тюринг
- cawiki Turing complet
- cswiki Turingovská úplnost
- dawiki Turing-komplet
- dewiki Turing-Vollständigkeit
- elwiki Πληρότητα Τούρινγκ
- enwiki Turing completeness
- eowiki Turing kompleteco
- eswiki Turing completo
- fawiki کامل بودن تورینگ
- fiwiki Turing-vahva
- frwiki Turing-complet
- iawiki Turing complete
- itwiki Turing equivalenza
- jawiki チューリング完全
- kowiki 튜링 완전
- nlwiki Turingvolledigheid
- nnwiki Turingkomplett
- nowiki Turingkomplett
- plwiki Kompletność Turinga
- ptwiki Turing completude
- ruwiki Полнота по Тьюрингу
- simplewiki Turing complete
- srwiki Тјурингова потпуност
- svwiki Turingkomplett
- ukwiki Повнота за Тюрінгом
- zh_yuewiki 圖靈完整性
- zhwiki 圖靈完備性