Davis–Putnam–Robinson–Matiyasevich theorem
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
DPRM theorem
|
| gptkbp:countryOfPublication |
gptkb:Russian
|
| gptkbp:field |
gptkb:logic
number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Davis–Putnam–Robinson–Matiyasevich theorem
|
| gptkbp:implies |
No algorithm exists to determine whether arbitrary Diophantine equations have integer solutions
|
| gptkbp:namedAfter |
gptkb:Hilary_Putnam
gptkb:Julia_Robinson gptkb:Martin_Davis gptkb:Yuri_Matiyasevich |
| gptkbp:publishedIn |
gptkb:Doklady_Akademii_Nauk_SSSR
|
| gptkbp:solvedBy |
gptkb:Hilbert's_tenth_problem
|
| gptkbp:state |
Every recursively enumerable set is Diophantine
|
| gptkbp:yearProved |
1970
|
| gptkbp:bfsParent |
gptkb:Julia_Robinson
|
| gptkbp:bfsLayer |
5
|