Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02412326n
Noun Concept
Categories: Programming language theory, All articles needing additional references, Articles with short description, Turing machine, Theory of computation
EN
Turing completeness  Computational universality  computationally universal  List of turing complete video games  Minimum capability
EN
In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. Wikipedia
Definitions
Relations
Sources
EN
In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. Wikipedia
Measure of the ability of a theoretical computing system to simulate a Turing machine Wikidata
HAS PART
Turing complete
NAMED AFTER
Turing
Wikipedia
EN
Turing completeness
Wikidata
EN
Turing completeness
Wikipedia Redirections
EN
Computational universality, computationally universal, List of turing complete video games, Minimum capability, Non-Turing-complete programming language, Turing-complete, Turing-complete device, Turing-complete language, Turing-complete programming language, Turing-completeness, Turing-powerful, Turing complete, Turing complete language, Turing equivalence (theory of computation)
Wikidata Alias
EN
computationally universal, Turing complete

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License