Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02458267n
Noun Named Entity
SYL
No term available
EN
In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages. Wikipedia
English:
complexity class
complexity
Relations
Sources
IS A
EN
complexity class
EN
computational problem
HAS PART
EN
PR
NEXPTIME
PART OF
EN
RE

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