Difference between revisions
hilbert-tenth
Status and infobox
- status:
—→ refuted - tier:
—→ V3 - kind:
—→ problem - year:
—→ 1900 - statement:
—→ Find an algorithm that decides whether any Diophantine equation has an integer solution.
Source +21 −0
+---
+title: Hilbert's tenth problem
+kind: problem
+status: refuted
+tier: V3
+year: 1900
+authors: David Hilbert
+statement: Find an algorithm that decides whether any Diophantine equation has an integer solution.
+space: algorithms
+---
+No such algorithm exists: every computably enumerable set is Diophantine, so a decision procedure would solve the halting problem. The version over the rationals is still open.
+
+*Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.*
+
+Posed 1900, David Hilbert. Closed 1970, Yuri Matiyasevich, completing Martin Davis, Hilary Putnam and Julia Robinson.
+
+## Sources
+
+- [Wikipedia: Hilbert's tenth problem](https://en.wikipedia.org/wiki/Hilbert%27s_tenth_problem)
+
+[[Space:algorithms|Algorithms]] · [[Continent:computation|Computation]]
Revision 68 as rendered
No such algorithm exists: every computably enumerable set is Diophantine, so a decision procedure would solve the halting problem. The version over the rationals is still open.
Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.
Posed 1900, David Hilbert. Closed 1970, Yuri Matiyasevich, completing Martin Davis, Hilary Putnam and Julia Robinson.