Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02458267n
Noun Named Entity
Categories: Complexity classes, Theoretical computer science stubs
EN
R
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
complexity class
Definitions
Relations
Sources
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
The set of all recursive languages Wikipedia Disambiguation
Set of all total computable functions Wikidata
IS A
complexity class
computational problem
HAS PART
PR
NEXPTIME
PART OF
RE
Wikipedia
EN
R (complexity)
Wikidata
EN
R
Wikipedia Redirections
EN
R (complexity class)

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