MRDP theorem

E2024566 UNEXPLORED

The MRDP theorem is a landmark result in mathematical logic and number theory that shows every recursively enumerable set is Diophantine, thereby proving the unsolvability of Hilbert’s tenth problem.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label Occurrences
MRDP theorem canonical 1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Hilbert's tenth problem solutionCollectiveName MRDP theorem
subject linked to: H10