{
  "id": "enwiki-001358371398",
  "slug": "pspace",
  "title": "PSPACE",
  "qid": "",
  "lead": ", NP, co-NP, BPP, P/poly, PH, and PSPACE {{unsolved|computer science|{{tmath|\\mathsf{P \\overset{?} PSPACE} }}}} In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.",
  "body": ", NP, co-NP, BPP, P/poly, PH, and PSPACE {{unsolved|computer science|{{tmath|\\mathsf{P \\overset{?} PSPACE} }}}} In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space. \\mathsf{PSPACE} = \\bigcup_{k\\in\\mathbb{N}} \\mathsf{SPACE}(n^k). It turns out that allowing the Turing machine to be nondeterministic does not add any extra power. Because of Savitch's theorem, \\mathsf{NPSPACE} is equivalent to \\mathsf{PSPACE} , because a deterministic Turing machine can simulate a nondeterministic Turing machine while roughly squaring the amount of space, and squaring takes polynomials to (bigger) polynomials. Also, the complements of all problems in \\mathsf{PSPACE} are also in \\mathsf{PSPACE} , meaning that \\mathsf{coPSPACE}=\\mathsf{PSPACE} . ==Further reading== Chapter 19: Polynomial space, pp.&nbsp;455–490. Chapter 8: Space Complexity",
  "categories": [
    "23057298",
    "23118434",
    "23603337"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1358371398",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1780896762.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001358371398",
    "type": "webpage",
    "title": "PSPACE",
    "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/pspace",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001358371398",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1358371398",
    "note": "Immutable snapshot enwiki-001358371398"
  }
}