bn:02458267n
Noun Named Entity
Categories: Theoretical computer science stubs, Complexity classes
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
Wikipedia
Wikidata
EN
R
Wikipedia Redirections