See Rice's theorem on Wiktionary
{
"etymology_text": "Named after Henry Gordon Rice, who proved it in 1951.",
"head_templates": [
{
"args": {},
"expansion": "Rice's theorem",
"name": "en-proper noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [],
"source": "w"
}
],
"glosses": [
"A theorem stating that all nontrivial semantic properties of programs are undecidable."
],
"id": "en-Rice's_theorem-en-name-PGCAVVwe",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"nontrivial",
"nontrivial"
],
[
"semantic",
"semantic"
],
[
"program",
"program"
],
[
"undecidable",
"undecidable"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Henry Gordon Rice"
]
}
],
"word": "Rice's theorem"
}
{
"etymology_text": "Named after Henry Gordon Rice, who proved it in 1951.",
"head_templates": [
{
"args": {},
"expansion": "Rice's theorem",
"name": "en-proper noun"
}
],
"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 theorem stating that all nontrivial semantic properties of programs are undecidable."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"nontrivial",
"nontrivial"
],
[
"semantic",
"semantic"
],
[
"program",
"program"
],
[
"undecidable",
"undecidable"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that all nontrivial semantic properties of programs are undecidable."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Henry Gordon Rice"
]
}
],
"word": "Rice's theorem"
}
Download raw JSONL data for Rice's theorem meaning in All languages combined (1.1kB)
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-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). 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.