Problems that cannot be solved by any algorithm are called?
(a) tractable problems
(b) intractable problems
(c) undecidable problems
(d) decidable problems
The question was asked during an online interview.
I want to ask this question from Checksum, Complexity Classes & NP Complete Problems topic in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II