Diophantine Representation of Enumerable Predicates

An example is given of a diophantine relation which has exponential growth. This, together with the well-known results of Martin Davis, Hilary Putnam, and Julia Robinson, yields a proof that every enumerable predicate is diophantine. This theorem implies that Hilbert's tenth problem is algorithmically unsolvable.