Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01488796n
Noun Concept
SYL
No term available
EN
In theoretical computer science, a nondeterministic Turing machine is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. Wikipedia
Relations
Sources
IS A
EN
Turing machine
HAS KIND
EN
linear bounded automaton
EN
probabilistic Turing machine
EN
unambiguous Turing machine
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