"EXPSPACE" meaning in English

{
  "head_templates": [
    {
      "args": {},
      "expansion": "EXPSPACE",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              89,
              97
            ]
          ],
          "ref": "1997, Michael Sipser, Introduction to the Theory of Computation, Boston, M.A.: PWS Publishing Company, →ISBN, page 313:",
          "text": "First, the hierarchy theorems tell us that a Turing machine can decide more languages in EXPSPACE than it can in PSPACE.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size."
      ],
      "id": "en-EXPSPACE-en-name-8TUHjGSw",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "decision problems",
          "decision problem#Noun"
        ],
        [
          "Turing machine",
          "Turing machine#Noun"
        ],
        [
          "memory",
          "memory#Noun"
        ],
        [
          "polynomial",
          "polynomial#Noun"
        ],
        [
          "input",
          "input#Noun"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "EXPSPACE"
}

{
  "head_templates": [
    {
      "args": {},
      "expansion": "EXPSPACE",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English proper nouns",
        "English terms with quotations",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              89,
              97
            ]
          ],
          "ref": "1997, Michael Sipser, Introduction to the Theory of Computation, Boston, M.A.: PWS Publishing Company, →ISBN, page 313:",
          "text": "First, the hierarchy theorems tell us that a Turing machine can decide more languages in EXPSPACE than it can in PSPACE.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "decision problems",
          "decision problem#Noun"
        ],
        [
          "Turing machine",
          "Turing machine#Noun"
        ],
        [
          "memory",
          "memory#Noun"
        ],
        [
          "polynomial",
          "polynomial#Noun"
        ],
        [
          "input",
          "input#Noun"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "EXPSPACE"
}