DPRM theorem

E2024567 UNEXPLORED

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

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
DPRM theorem canonical	1

Referenced by (1)

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

Davis–Putnam–Robinson–Matiyasevich theorem → alsoKnownAs → DPRM theorem ⓘ