openproblem.space·the wiki Sign in to edit
Difference between revisions

hilbert-tenth

Revision 68 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 68 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

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.

Sources

Algorithms · Computation