Matiyasevich's theorem
Matiyasevich's theorem proper noun: a theorem stating that every computably enumerable set is a Diophantine set, and the converse.
Proper noun
Matiyasevich's theorem
- A theorem stating that every computably enumerable set is a Diophantine set, and the converse.
- Synonyms:
- MRDP theorem
Synonyms of Matiyasevich's theorem
Origin of Matiyasevich's theorem
Named after Russian mathematician Yuri Matiyasevich.
Questions about Matiyasevich's theorem
- What does Matiyasevich's theorem mean?
- Matiyasevich's theorem means a theorem stating that every computably enumerable set is a Diophantine set, and the converse.
- What part of speech is Matiyasevich's theorem?
- Matiyasevich's theorem is a proper noun.
Words near Matiyasevich's theorem in the dictionary
Source and license
Adapted from Wiktionary: Matiyasevich's theorem (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Matiyasevich's theorem.” Word.ws, https://word.ws/matiyasevich%27s_theorem. Based on Wiktionary, CC BY-SA 4.0.
