Skip to search formSkip to main contentSkip to account menu

Hilbert's tenth problem

Known as: Hilbert's 10th problem, Hilberts tenth problem, 10th Hilbert problem 
Hilbert's tenth problem is the tenth on the list of Hilbert's problems of 1900. Its statement is as follows: Given a Diophantine equation with any… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's… 
2017
2017
For a ring R, Hilbert’s Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R… 
2017
2017
Hilbert’s Tenth Problem (HTP) asked for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer… 
Highly Cited
2010
Highly Cited
2010
Highly Cited
2008
Highly Cited
2008
Received 3 October 2007; revised 21 December 2007; accepted 7 January 2008; published 15 April 2008. [1] Detailed homogeneity… 
Review
2005
Review
2005
This is a survey of a century long history of interplay between Hilbert's tenth problem (about solvability of Diophantine… 
Review
1994
Review
1994
The present article is an attempt to bridge the gap between the researchers that work in the areas adjacent to Hilbert's Tenth… 
1958
1958
Hilbert's tenth problem is to find an algorithm for determining whether or not a diophantine equation possesses solutions. A…