Abstract
Hilbert’s Tenth Problem goes back to the year 1900 and concerns a fundamental question, namely whether there is an algorithmic method for solving Diophantine equations. The ultimate solution to this problem was not achieved until 1970. The “solution” wets, however, a negative one: there is no such algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). Hilbert’s Tenth Problem. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive