This question already has an answer here:

Is there a general framework for showing that a problem has no algorithm? For example, to show that two problems are equally as hard to each other, we use reduction.

One example of where this was done, is Hilbert's 10th problem


marked as duplicate by David Richerby complexity-theory Jun 19 at 18:35

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.


The term or tag you are looking for is "undecidability" or "computability". The basic version of the theory of undecidability is a part of the theory of computation, which is an ingredient of the curriculum of all students majoring in Compute Science, as far as I know.

You can search for "undecidability" or "halting problem", the most famous and the most canonical problem that cannot be solved by an algorithm, in your textbook or course material. Or right here. There are also much stuff around.


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