See EXPTIME in All languages combined, or Wiktionary
Download JSONL data for EXPTIME meaning in English (1.3kB)
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "EXPTIME (uncountable)",
"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"
}
],
"glosses": [
"The set of all decision problems that are solvable by a deterministic Turing machine in exponential time."
],
"id": "en-EXPTIME-en-noun-CGBY3ean",
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"decision",
"decision"
],
[
"problems",
"problems"
],
[
"solvable",
"solvable"
],
[
"deterministic Turing machine",
"deterministic Turing machine"
],
[
"exponential time",
"exponential time"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "EXPTIME"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "EXPTIME (uncountable)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English uncountable nouns",
"en:Computer science"
],
"glosses": [
"The set of all decision problems that are solvable by a deterministic Turing machine in exponential time."
],
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"decision",
"decision"
],
[
"problems",
"problems"
],
[
"solvable",
"solvable"
],
[
"deterministic Turing machine",
"deterministic Turing machine"
],
[
"exponential time",
"exponential time"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "EXPTIME"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-06-27 from the enwiktionary dump dated 2024-06-20 using wiktextract (0f7b3ac and b863ecc). 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.