In the https://en.wikipedia.org/wiki/Computational_problem, the first line states: "A computational problem is a problem that may be solved by an algorithm." However, I have doubts about the accuracy of this definition.
As I understand it, there are computational problems that cannot be solved by algorithms, such as undecidable problems (e.g., the Halting Problem). These problems cannot be solved by any algorithm, so what happens with all the problems that are undecidable? Are they not considered computational problems, or are they just problems? If they are just problems, what kind of problems would they be classified as? Would they be any kind of problem?
My questions are:
- Is the Wikipedia definition correct?
- If not, what is the most widely accepted definition of a "computational problem" that includes both problems that can be solved by algorithms and those that cannot be solved?
I appreciate any clarification or references to more precise sources on this topic.