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.
2014
2014
Using an iterated Horner schema for evaluation of diophantine polynomials, we define a partial $\mu$-recursive "decision… 
2011
2011
Tomando el concepto percepcion del tiempo en sentido amplio, en el pre -sente articulo, se agruparon en perfiles las dimensiones… 
Review
2008
Review
2008
Introduction One of the first tasks undertaken by Model Theory was to produce elimination results, for example methods of… 
2007
2007
Following ideas of Poonen, we use elliptic divisibility sequences to construct two subrings of the field of rational numbers… 
2003
2003
Abstract. The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic… 
2003
2003
  • T. Kieu
  • 2003
  • Corpus ID: 2212177
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's… 
1999
1999
Well deliverability in most gas condensate reservoirs is reduced by condensate banking when the well bottom hole pressure falls… 
1958
1958
Hilbert's tenth problem is to find an algorithm for determining whether or not a diophantine equation possesses solutions. A…