Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? (Q2843817): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0901.2093 / rank | |||
Normal rank | |||
Latest revision as of 10:02, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? |
scientific article |
Statements
Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? (English)
0 references
26 August 2013
0 references
Davis-Putnam-Robinson-Matiyasevich theorem
0 references
Matiyasevich's conjecture on finite-fold Diophantine representations
0 references
