See autoreducible on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "auto",
"3": "reducible"
},
"expansion": "auto- + reducible",
"name": "prefix"
}
],
"etymology_text": "From auto- + reducible.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "autoreducible (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "English terms prefixed with auto-",
"parents": [],
"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": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"Of a set, that can be reduced to itself by a Turing machine that does not ask for its own input."
],
"id": "en-autoreducible-en-adj-ghCM3-gO",
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"set",
"set#English"
],
[
"reduced",
"reduced#English"
],
[
"Turing machine",
"Turing machine#English"
],
[
"input",
"input#English"
]
],
"raw_glosses": [
"(mathematics, set theory) Of a set, that can be reduced to itself by a Turing machine that does not ask for its own input."
],
"related": [
{
"word": "autoreducibility"
}
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"word": "autoreducible"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "auto",
"3": "reducible"
},
"expansion": "auto- + reducible",
"name": "prefix"
}
],
"etymology_text": "From auto- + reducible.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "autoreducible (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "autoreducibility"
}
],
"senses": [
{
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms prefixed with auto-",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries",
"en:Mathematics",
"en:Set theory"
],
"glosses": [
"Of a set, that can be reduced to itself by a Turing machine that does not ask for its own input."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"set",
"set#English"
],
[
"reduced",
"reduced#English"
],
[
"Turing machine",
"Turing machine#English"
],
[
"input",
"input#English"
]
],
"raw_glosses": [
"(mathematics, set theory) Of a set, that can be reduced to itself by a Turing machine that does not ask for its own input."
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"word": "autoreducible"
}
Download raw JSONL data for autoreducible meaning in All languages combined (1.2kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-15 from the enwiktionary dump dated 2025-01-01 using wiktextract (b941637 and 4230888). 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.