Hilbert’s tenth problem
E208849
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Hilbert’s tenth problem canonical | 2 |
| Diophantine equations decision problem | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1859184 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Hilbert’s tenth problem Context triple: [Hilbert problems, hasPart, Hilbert’s tenth problem]
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
D.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
E.
Hilbert problems
The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Hilbert’s tenth problem Target entity description: Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
-
A.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
D.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
E.
Hilbert problems
The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
decision problem
ⓘ
mathematical problem ⓘ problem in computability theory ⓘ problem in number theory ⓘ |
| alsoKnownAs | H10 ⓘ |
| answer | no algorithm exists that solves it in general ⓘ |
| asksFor |
algorithm to decide solvability of Diophantine equations in integers
ⓘ
general method to determine whether a Diophantine equation has an integer solution ⓘ |
| concerns |
Diophantine equations
ⓘ
integer solutions of polynomial equations ⓘ |
| decidability | undecidable ⓘ |
| field |
computability theory
ⓘ
mathematical logic ⓘ mathematics ⓘ number theory ⓘ |
| formalizationUses | polynomial equations with integer coefficients ⓘ |
| historicalImportance |
central in development of modern computability theory
ⓘ
key example of an undecidable problem in number theory ⓘ |
| impliesLimitOn | algorithmic solvability of Diophantine equations ⓘ |
| inputType | Diophantine equation ⓘ |
| inspiredWorkBy |
Hilary Putnam
ⓘ
Julia Robinson ⓘ Martin Davis ⓘ Yuri Matiyasevich ⓘ |
| locationPosed | Paris ⓘ |
| numberInHilbertList | 10 ⓘ |
| outputType | yes-no answer about existence of integer solutions ⓘ |
| partOf |
Hilbert problems
ⓘ
surface form:
Hilbert’s problems
|
| posedBy | David Hilbert ⓘ |
| presentedAt |
International Congress of Mathematicians
ⓘ
surface form:
International Congress of Mathematicians 1900
|
| quantifiesOver | integer solutions ⓘ |
| relatedTo |
Church–Turing thesis
ⓘ
Davis–Putnam–Robinson–Matiyasevich theorem ⓘ Turing machine ⓘ computably enumerable sets ⓘ recursively enumerable sets ⓘ |
| shows |
fundamental limits of computability
ⓘ
not all mathematical questions about integers are algorithmically decidable ⓘ |
| solutionCompletedBy | Yuri Matiyasevich ⓘ |
| solutionStatus | negatively solved ⓘ |
| solvedBy |
Hilary Putnam
ⓘ
Julia Robinson ⓘ Martin Davis ⓘ Yuri Matiyasevich ⓘ |
| status | unsolvable by algorithm ⓘ |
| yearPosed | 1900 ⓘ |
| yearSolutionCompleted | 1970 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Hilbert’s tenth problem Description of subject: Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.