{
  "id": "enwiki-001314490235",
  "slug": "pr-complexity",
  "title": "PR (complexity)",
  "qid": "",
  "lead": "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).",
  "body": "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 ,&nbsp; 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).",
  "categories": [
    "23057298"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1314490235",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1759334680.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001314490235",
    "type": "webpage",
    "title": "PR (complexity)",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/pr-complexity",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001314490235",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1314490235",
    "note": "Immutable snapshot enwiki-001314490235"
  }
}