scientific article; zbMATH DE number 1500614

From MaRDI portal
Publication:4501636





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].




Cited in
(25)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501636)