Can every solvable problem be solved using any algorithm design?
I recently started reading theory behind algorithms. I then started thinking about "what if we abstract problems and algorithms, so you would be able to implement a generic system that can solve most problems.". Unfortunately I was not able to find information on this topic. Logic Programming comes pretty close I guess, but I don't think it would be easy to make a library with something like that. As the question suggests, this 'generic algorithm' would only solve 'generic problems' and the problems will obviously have to be (proven) solvable in the first place. I thought every problem that is solvable through what Wikipedia categorizes as 'algorithms by design' (https://en.wikipedia.org/wiki/Algorithm#By_design_paradigm) make good candidates. So the actual question becomes more something like:"Can we define an abstract problem that is solvable by an abstract algorithm, that employs Backtracking, Divide & Conquer etc.?". I think something like this is possible, that such an abstract representation of a problems exist that it can be solved by any of these algorithms.
I recently started reading theory behind algorithms. I then started thinking about "what if we abstract problems and algorithms, so you would be able to implement a generic system that can solve most problems.". Unfortunately I was not able to find information on this topic. Logic Programming comes pretty close I guess, but I don't think it would be easy to make a library with something like that.
As the question suggests, this 'generic algorithm' would only solve 'generic problems' and the problems will obviously have to be (proven) solvable in the first place. I thought every problem that is solvable through what Wikipedia categorizes as 'algorithms by design' (https://en.wikipedia.org/wiki/Algorithm#By_design_paradigm) make good candidates.
So the actual question becomes more something like:"Can we define an abstract problem that is solvable by an abstract algorithm, that employs Backtracking, Divide & Conquer etc.?".
I think something like this is possible, that such an abstract representation of a problems exist that it can be solved by any of these algorithms.
