No label defined (Q4501636)
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 1500614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1500614 |
Statements
20 March 2001
0 references
Hilbert's 10th problem
0 references
diophantine equations
0 references
decision problems
0 references
Julia Robinson
0 references
Matiyasevich
0 references
0.8869193196296692
0 references
0.8769564032554626
0 references
A readable review of the history of Hilbert's 10th problem: is there an algorithm for finding all solutions of diophantine equations? The work of Matiyasevich and Julia Robinson showed that the problem is undecidable: no algorithm exists which, for an arbitrary diophantine equation, will tell us whether the equation has a solution or not. Further developments of the ideas behind the proof of the undecidability are given: diophantine sets of \(n\)-tuples on integers; listable sets; universal diophantine equations; and developing from these the Davis-Robinson-Putnam theorem on the solvability of certain exponential polynomial diophantine equations. There are 27 references. For the entire collection see [Zbl 0940.00005].
0 references
