See time hierarchy theorem on Wiktionary
{
"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": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"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"
}
{
"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",
"Pages with 1 entry",
"Pages with entries",
"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"
}
Download raw JSONL data for time hierarchy theorem meaning in All languages combined (1.3kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.