Connection between the two-variable case of Hilbert's Tenth Problem and Roth's Theorem. Connection between Hilbert's Tenth Problem and Roth's Theorem.
The following two decision problems seem to be open:


*

*Given a polynomial equation in two variables with integer coefficients, determine whether there are any integer solutions. (The two-variable case of Hilbert's Tenth Problem)

*Given a real algebraic number $r$  and given integers $B,N > 0$,  determine whether  the inequalities  $|rx-y|  <  \frac{1}{x^{1+1/N}}$, $0 < x < B$  are solvable in integers $x$ and $y$. (This is the problem of the effective Roth bound -- Roth proved that for any algebraic $r$ and for any $N > 0 $, inequality $|rx-y| <  \frac{1}{x^{1+1/N}}$ has only finitely many  solutions in positive integers $x,y$.)
Now I heard once that an effective algorithm for the Roth bound  would yield an effective algorithm for the two variable case of Hilbert's Tenth Problem.  I can begin to imagine that this might be true for norm-form equations, following the treatment in Schmidt's books, but the general case seems quite opaque. 
Can anyone suggest any references along these lines? Also, does anyone know of  surveys summarizing what has been done to-date on the  of the decidability of the two-variable case of Hilbert's Tenth Problem? Finally, does anyone know any interesting "plausibility arguments" for or against decidability?
 A: An effective Roth's theorem would yield an effective Siegel's theorem by the usual proof. See, e.g. Lang's Fundamentals of Diophantine Geometry.
The case of diophantine equation of two variables is generally believed to be decidable. Poonen has a couple of expository articles on this (check his web page) that you might find useful.
A: Here is a plausibility argument for decidability. 

DISCLAIMER: I am in no way an expert and admittedly an optimist.

The way you show that Hilbert's Tenth Problem has a negative solution is by showing that diophantine equations can "cut out" every recursively enumerable subset of $\Bbb Z.$ The negative solution follows from the fact that there are recursively enumerable subsets which are not recursive. For a quick introduction see Mazur's recent expository lecture notes here.

Moral: Diophantine equations can define sets which are too complicated!

For each recursively enumerable subset $S$ of $\Bbb Z$ we can define the diophantine dimension of $S$ as the smallest such $n$ for which there is a diophantine equation in $n$ variables with integer coefficients which cuts out $S$. (Experts: Is there a better name for this integer?)
For example, this popular MO question of Poonen asks roughly to determine if the diophantine dimension of $\Bbb N$ is 2? This seems to be incredibly hard. It seems plausible that the relatively tame subset $\Bbb N$ of $\Bbb Z$ might have diophantine dimension $ > 2$. So I feel free to hope that the even more complicated sets which lead to undecidability are complicated enough that they have diophantine dimension greater than 2. 
