R (計算複雑性理論)
1. R (complexity)In computational complexity theory, R is the class of decision problems solvable by a Turing machine, which is the set of all recursive languages. R is equal to the set of all total computable functions. Since we can decide any problem for which there exists a recogniser and also a co-recogniser by simply interleaving them until one obtains a result, the class is equal to .
Read “R (complexity)” on English Wikipedia
Read “R (計算複雑性理論)” on Japanese Wikipedia
Read “R (complexity)” on DBpedia
Read “R (complexity)” on English Wikipedia
Read “R (計算複雑性理論)” on Japanese Wikipedia
Read “R (complexity)” on DBpedia
Discussions
Log in to talk about this word.