Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite?

Publication date: 14 September 2013

Decidability (number-theoretic aspects) (11U05) Recursively (computably) enumerable sets and degrees (03D25)

This page was built for publication: Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite?