In Theoretical Computer Science, which one is more important? Computability of a problem or Complexity of a problem?
closed as unclear what you're asking by Vor, Juho, David Richerby, Guy Coder, J.-E. Pin Oct 27 '13 at 15:58
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
Both computability and complexity are theoretical abstractions. A theoretical abstraction is most useful, if the gap between theory and practice is small.
It is well known that there is a large gap between a problem whose solutions is computable in theory, and one whose solution is computable in practice. Complexity theory managed to shrink that gap considerably, to the point where the remaining gap is caused by factors like cache behavior, parallelization, large scale distribution and similar advanced practical issues.
Computability theory has been able to prove that certain problems can't be solved. One might believe that there can't be any gap between theory and practice here, but this is not the case. It seems like Gödel's incompleteness theorems from 1931 would prove that the consistency of the Peano axioms can't be decided. However, Gentzen proved the consistency of the Peano axioms in a paper published in 1936. I know that there is a nice theoretical explanation for this, but I'm (still) unable to judge the practical consequences, and I guess I'm not alone in this.
Complexity theory still struggles to rigorously prove lower bounds for most important practical problems, even so it slowly advances in this direction. One may question whether these theoretical lower bounds are important at all, because we have no guarantee that the practical lower bounds have to respect these theoretical bounds. However, it turns out that the practical lower bounds closely match the theoretical lower bounds, so that this objection is unfounded in practice.
The above comparison might suggest that computability theory is not much use in practice compared to complexity theory. However, things like the Chomsky hierarchy and a bunch of other similarly useful results should easily disprove this suspicion.