Hilbert's 10th Problem (Foundations of Computing)

Category: Study


<< Buy This Book on Amazon >>

60 views since 2007-07-06. Bookmark this: Hilbert s 10th Problem Foundations of Computing

Description


pic info: 2007-05-23/41KF8XW9GAL_orig Hilbert's 10th Problem (Foundations of Computing)
Hilbert's 10th Problem (Foundations of Computing)
Publisher: The MIT Press | Number Of Pages: 288 | ISBN / ASIN: 0262132958 | 5MB
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.

Download
Mirror

No Mirrors please
ID117513 117513 fredorm 23 May 2007 11:19 Thanks ID:414472 414472 a1111111 23 May 2007 12:52 thanks ID:414510 414510 cheredov 25 May 2007 12:23 Thank You! ID:288100 288100

$$ Buy "Hilbert's 10th Problem (Foundations of Computing)" on Amazon $$


Search More...

Hilbert's 10th Problem (Foundations of Computing)

Search free ebooks in ebookee.com!


Links

Search and Buy
<< Search and Buy This Book on Amazon >>

No download links here
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.


Related Books


Books related to "Hilbert's 10th Problem (Foundations of Computing)":


Comments


No comments for "Hilbert's 10th Problem (Foundations of Computing)".


    Add Your Comments

    1. Download links and password may be in the description section, read description carefully!
    2. Do a search to find mirrors if no download links or dead links.

    required

    required, hidden

    need login

    required

    More Categories

    We Recommend

    Email Subscribe

    Enter your email address:

    Delivered by FeedBurner

    Feed & Bookmark

    • Add to Google Reader or Homepage

    Sponsored Links

    Back to Top