See APTIME in All languages combined, or Wiktionary
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "APTIME (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": "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"
}
],
"glosses": [
"The set of problems decidable by an alternating Turing machine in polynomial time."
],
"id": "en-APTIME-en-noun-2sjthO-C",
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"problem",
"problem"
],
[
"decidable",
"decidable"
],
[
"alternating Turing machine",
"alternating Turing machine"
],
[
"polynomial time",
"polynomial time"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The set of problems decidable by an alternating Turing machine in polynomial time."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "APTIME"
}
{
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "APTIME (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",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"The set of problems decidable by an alternating Turing machine in polynomial time."
],
"links": [
[
"computer science",
"computer science"
],
[
"set",
"set"
],
[
"problem",
"problem"
],
[
"decidable",
"decidable"
],
[
"alternating Turing machine",
"alternating Turing machine"
],
[
"polynomial time",
"polynomial time"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) The set of problems decidable by an alternating Turing machine in polynomial time."
],
"tags": [
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "APTIME"
}
Download raw JSONL data for APTIME meaning in English (1.0kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.