time hierarchy theorem in English

[Show JSON for post-processed kaikki.org data shown on this page ▼] [Hide JSON for post-processed kaikki.org data shown on this page ▲]

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "time hierarchy theorem",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide."
      ],
      "id": "en-time_hierarchy_theorem-en-noun-lO-dtlqf",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "demonstrate",
          "demonstrate"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "additional",
          "additional"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "time",
          "time"
        ],
        [
          "strictly",
          "strictly"
        ],
        [
          "increase",
          "increase"
        ],
        [
          "class",
          "class"
        ],
        [
          "language",
          "language"
        ],
        [
          "decide",
          "decide"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computer science) A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "time hierarchy theorem"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "time hierarchy theorem",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "en:Computer science",
        "en:Mathematics"
      ],
      "glosses": [
        "A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "theorem",
          "theorem"
        ],
        [
          "demonstrate",
          "demonstrate"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "additional",
          "additional"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "time",
          "time"
        ],
        [
          "strictly",
          "strictly"
        ],
        [
          "increase",
          "increase"
        ],
        [
          "class",
          "class"
        ],
        [
          "language",
          "language"
        ],
        [
          "decide",
          "decide"
        ]
      ],
      "raw_glosses": [
        "(mathematics, computer science) A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "time hierarchy theorem"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.

"time hierarchy theorem" meaning in English

Noun