Complexity
Even when a problem is decidable, it might not be solvable in practice, since the optimal Turing machine which decides this problem could require astronomical time.
Even when a problem is decidable, it might not be solvable in practice, since the optimal Turing machine which decides this problem could require astronomical time.