Hilbert's 10th Problem (Foundations of Computing)

Description

   

At the 1900 International Congress of Mathematicians, held that year in Paris, the German mathematician David Hilbert put forth a list of 23 unsolved problems that he saw as being the greatest challenges for twentieth-century mathematics. Hilbert's 10th problem, to find a method (what we now call an algorithm) for deciding whether a Diophantine equation has an integral solution, was solved by Yuri Matiyasevich in 1970. Proving the undecidability of Hilbert's 10th problem is clearly one of the great mathematical results of the century.
This book presents the full, self-contained negative solution of Hilbert's 10th problem. In addition it contains a number of diverse, often striking applications of the technique developed for that solution (scattered previously in journals), describes the many improvements and modifications of the original proof - since the problem was "unsolved" 20 years ago, and adds several new, previously unpublished proofs.

Included are numerous exercises that range in difficulty from the elementary to small research problems, open questions,and unsolved problems. Each chapter concludes with a commentary providing a historical view of its contents. And an extensive bibliography contains references to all of the main publications directed to the negative solution of Hilbert's 10th problem as well as the majority of the publications dealing with applications of the solution.

Intended for young mathematicians, Hilbert's 10th Problem requires only a modest mathematical background. A few less well known number-theoretical results are presented in the appendixes. No knowledge of recursion theory is presupposed. All necessary notions are introduced and defined in the book, making it suitable for the first acquaintance with this fascinating subject.

Yuri Matiyasevich is Head of the Laboratory of Mathematical Logic, Steklov Institute of Mathematics, Russian Academy of Sciences, Saint Petersburg.


    Thanks

    thanks

    Thank You!

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Hilbert's 10th Problem (Foundations of Computing)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 583
2. Hilbert's 10th Problem (Foundations of Computing)
3. From Kant to Hilbert Volume 1: A Source Book in the Foundations of Mathematics
4. From Kant to Hilbert Volume 1: A Source Book in the Foundations of Mathematics
5. [share_ebook] From Kant to Hilbert: A Source Book in the Foundations of Mathematics vol 1 & 2
6. Origins and Foundations of Computing
7. Dynamic Logic (Foundations of Computing)
8. Computability and Complexity: From a Programming Perspective (Foundations of Computing)
9. Autonomy Oriented Computing: From Problem Solving to Complex Systems Modeling
10. Autonomy.Oriented.Computing.From.Problem.Solving.to.Complex.Systems.Modeling
11. Autonomy Oriented Computing: From Problem Solving to Complex Systems Modeling
12. Autonomy Oriented Computing: From Problem Solving to Complex Systems Modeling
13. Autonomy Oriented Computing From Problem Solving to Complex Systems Modeling
14. Autonomy Oriented Computing: From Problem Solving to Complex Systems Modeling
15. Algorithmic Number Theory, Vol. 1: Efficient Algorithms (Foundations of Computing)
16. Foundations of Learning Classifier Systems (Studies in Fuzziness and Soft Computing)