Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What type of famous equation except diophantine equation such that no algorithm can exist to determine whether there is a solution?

I know that if these equation have a solution, then it could be solving with finite amount of time.

By the way, how long does mathematician tend to give up for solving such equations?

share|cite|improve this question
up vote 2 down vote accepted

The impossibility of solving diophantine equations in general leads to a number of other impossibility results. For example, Richardson's theorem says that in a certain class of functions there is no algorithm to test whether the function is identically $0$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.