> martin dowd wrote: > >> Important examples of unsolvable problems include: >> -is a statement of predicate logic valid? >> -is a statement in the language of rings true in the theory of rings? >> -is a polynomial with integer coefficients have an integer root? > > > Are you absolutely sure about the last one?
That is the Diophantine Problem proposed by Hilbert. It has been shown to be recursively unsolvable.