Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01420211n
Noun Concept
SYL
No term available
EN
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Wikipedia
Relations
Sources
IS A
EN
computational problem

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