Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?

Apoloniusz Tyszka. Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?. Fundamenta Informaticae, 125(1):95-99, 2013. [doi]

Abstract

Abstract is missing.