PR (計算複雑性理論)
1. PR (complexity)PR is the complexity class of all primitive recursive functions – or, equivalently, the set of all formal languages that can be decided by such a function. This includes addition, multiplication, exponentiation, tetration, etc. The Ackermann function is an example of a function that is not primitive recursive, showing that PR is strictly contained in R. PR functions can be explicitly enumerated, whereas not all functions R can be.
Read “PR (complexity)” on English Wikipedia
Read “PR (計算複雑性理論)” on Japanese Wikipedia
Read “PR (complexity)” on DBpedia
Read “PR (complexity)” on English Wikipedia
Read “PR (計算複雑性理論)” on Japanese Wikipedia
Read “PR (complexity)” on DBpedia
Discussions
Log in to talk about this word.