See Chaitin's algorithm in All languages combined, or Wiktionary
{
"etymology_text": "Devised by Gregory Chaitin.",
"head_templates": [
{
"args": {},
"expansion": "Chaitin's algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"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": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A bottom-up graph coloring register allocation algorithm that uses cost/degree as its spill metric."
],
"id": "en-Chaitin's_algorithm-en-name-pDWtQByo",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"bottom-up",
"bottom-up"
],
[
"graph",
"graph"
],
[
"coloring",
"coloring"
],
[
"register",
"register"
],
[
"allocation",
"allocation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(computing theory) A bottom-up graph coloring register allocation algorithm that uses cost/degree as its spill metric."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Chaitin's algorithm"
}
{
"etymology_text": "Devised by Gregory Chaitin.",
"head_templates": [
{
"args": {},
"expansion": "Chaitin's algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A bottom-up graph coloring register allocation algorithm that uses cost/degree as its spill metric."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"bottom-up",
"bottom-up"
],
[
"graph",
"graph"
],
[
"coloring",
"coloring"
],
[
"register",
"register"
],
[
"allocation",
"allocation"
],
[
"algorithm",
"algorithm"
]
],
"raw_glosses": [
"(computing theory) A bottom-up graph coloring register allocation algorithm that uses cost/degree as its spill metric."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Chaitin's algorithm"
}
Download raw JSONL data for Chaitin's algorithm meaning in English (1.1kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-10-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (9f93753 and c1a3a36). 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.