Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00554043n
Noun Concept
Categories: Articles with short description, All Wikipedia articles needing clarification, Turing machine
EN
decider  machine that always halts  Decider Turing machine  machines that always halt  total Turing machine
EN
In computability theory, a decider is a Turing machine that halts for every input. Wikipedia
English:
computability theory
Definitions
Relations
Sources
EN
In computability theory, a decider is a Turing machine that halts for every input. Wikipedia
A Turing machine that eventually halts for every input Wikipedia Disambiguation
IS A
Turing machine
Wikipedia
EN
decider (Turing machine)
Wikidata
EN
machine that always halts
Wikipedia Redirections
EN
Decider (computability theory), Decider Turing machine, Machine that always halts, machines that always halt, total Turing machine
Wikidata Alias
EN
decider, total Turing machine

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