>> Question: Why is this undecidable?
> 
>> Surely it's a trivial matter of iterating over all integers and 
>> testing whether any of them is a root?
> 
> If there is no solution to a given polynomial, when does this program 
> you describe halt?

...so it's "undecidable" because you can't always figure out the answer 
in finite time?

-- 
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*

Post a reply to this message