How to solve diophantine problems?

[Michael Hudson]

claird at starbase.neosoft.com (Cameron Laird) writes:

> It's possible, though, that Mr. Joshua is asking for something like
> an algorithm to determine upper bounds on solutions, depending on P.
> That's a very hard problem, at least for today.

I'd say; it's strictly impossible, if the question is what I think it
is (by the MRDP theorem).

Cheers,
M.

-- 
  The use of COBOL cripples the mind; its teaching should, therefore,
  be regarded as a criminal offence.
           -- Edsger W. Dijkstra, SIGPLAN Notices, Volume 17, Number 5