Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02412326n
Noun Concept
SYL
No term available
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
Relations
Sources
HAS PART
EN
Turing complete
NAMED AFTER
EN
Turing

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