H10

E838585

H10 is the shorthand name for Hilbert’s tenth problem, a famous decision problem in number theory concerning the solvability of Diophantine equations.

All labels observed (1)

Label Occurrences
H10 canonical 1

How this entity was disambiguated

Statements (44)

Predicate Object
instanceOf Hilbert's tenth problem
mathematical problem
alsoKnownAs Hilbert's tenth problem
answerType negative
asksAbout existence of an algorithm for Diophantine solvability
solvability of Diophantine equations
classification undecidable problem
concerns Diophantine equations
algorithmic decidability
recursively enumerable sets
undecidability
field mathematical logic
number theory
hasComplexityProperty recursively unsolvable
historicalContext turn of the 20th century foundational questions in mathematics
implies undecidability of Diophantine equation solvability
influenceOn computability in number theory
logic and foundations of mathematics
involves integer solutions
polynomial equations with integer coefficients
keyResult every recursively enumerable set is Diophantine
language originally formulated in German
notation H10
openVariant Hilbert's tenth problem over number fields
Hilbert's tenth problem over the rationals
originalQuestion To devise a process according to which it can be determined in a finite number of operations whether a given Diophantine equation is solvable in integers
partOf Hilbert's problems
linked to: Hilbert problems
posedBy David Hilbert
positionInSeries 10
presentedAt International Congress of Mathematicians 1900
relatedTo Church–Turing thesis
Davis–Putnam–Robinson–Matiyasevich theorem
Hilbert's problems
linked to: Hilbert problems

Turing machines
linked to: Turing machine

computability theory
solutionCollectiveName MRDP theorem
solutionProperty no algorithm exists that decides solvability of all Diophantine equations in integers
solutionYear 1970
solvedBy Hilary Putnam
Julia Robinson
Martin Davis
Yuri Matiyasevich
status unsolvable as stated
yearPosed 1900

How these facts were elicited

Referenced by (1)

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