No label defined (Q4513976)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1531933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1531933 |
Statements
11 March 2001
0 references
decidability
0 references
algebraic integers
0 references
diophantine equation
0 references
Hilbert's tenth problem
0 references
0.9753713011741638
0 references
0.9753713011741638
0 references
0.8746230602264404
0 references
0.8735482692718506
0 references
Hilbert's tenth problem asks for an algorithm which, given an arbitrary diophantine equation, checks the equation for having or not having integer solutions. The final answer to the problem is negative: no such algorithm exists. But what if one asks the similar question for the ring of integers of a number field, such as \({\mathbb{Z}}[i]\) (the Gaussian integers)? Should an algorithm exist for any one such ring (therefore, by known arguments, also for any such ring that contains this one), Hilbert's tenth problem may be thought of as having an essentially positive answer with \({\mathbb Z}\) being an exception. Work on the generalized problem has been initiated by Denef and Lipshitz, who produced a number of negative results and conjectured that the answer is in general negative. The author, who has herself produced similar results, presents an account of the existing results and organizes some of the known methods of proof in a way that a new researcher on this subject will appreciate. For the entire collection see [Zbl 0945.00017].
0 references