PR (complexity)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

PR is the complexity class of all primitive recursive functions—or, equivalently, the set of all formal languages that can be decided in time bounded 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 (Cooper 2004:88). On the other hand, we can "enumerate" any recursively enumerable set (see also its complexity class RE) by a primitive-recursive function in the following sense: given an input (M, k) , where M is a Turing machine and k is an integer, if M halts within k steps then output M ; otherwise output nothing. Then the union of the outputs, over all possible inputs ( M , k ), is exactly the set of M that halt. PR strictly contains ELEMENTARY. PR does not contain "PR-complete" problems (assuming, e.g., reductions that belong to ELEMENTARY).

PR is the complexity class of all primitive recursive functions—or, equivalently, the set of all formal languages that can be decided in time bounded 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 (Cooper 2004:88). On the other hand, we can "enumerate" any recursively enumerable set (see also its complexity class RE) by a primitive-recursive function in the following sense: given an input (M, k) , where M is a Turing machine and k is an integer, if M halts within k steps then output M ; otherwise output nothing. Then the union of the outputs, over all possible inputs ( M ,  k ), is exactly the set of M that halt. PR strictly contains ELEMENTARY. PR does not contain "PR-complete" problems (assuming, e.g., reductions that belong to ELEMENTARY).

Text derived from https://en.wikipedia.org/w/index.php?oldid=1314490235 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001314490235 · captured 1759334680.0 · version history

Cite this page as: encyclopegia.org, “PR (complexity)”, snapshot enwiki-001314490235. https://encyclopegia.org/a/pr-complexity

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.