{c}
{tag=Undecidable problem}
{tag=Hilbert's problems}
{title2=1970}
{wiki}

= Determine if one Diophantine equation has a solution
{synonym}
{title2}

Once you hear about the <uncomputability> of such problems, it makes you see that all <Diophantine equation> questions risk being <undecidable>, though in some simpler cases we manage to come up with answers. The feeling is similar to watching people trying to solve the <Halting problem>, e.g. in the effort to determine <BB(5)>.


Hilbert s tenth problem

ID: hilbert-s-tenth-problem