Matiyasevich–Robinson–Davis–Putnam theorem
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:MRDP_theorem
|
| gptkbp:field |
gptkb:logic
computability theory number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Matiyasevich–Robinson–Davis–Putnam 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:relatedTo |
gptkb:Hilbert's_problems
gptkb:Diophantine_set recursively enumerable set |
| gptkbp:solvedBy |
gptkb:Hilbert's_tenth_problem
|
| gptkbp:state |
Every recursively enumerable set is Diophantine
|
| gptkbp:yearProved |
1970
|
| gptkbp:bfsParent |
gptkb:MRDP_theorem
|
| gptkbp:bfsLayer |
8
|