Halting problem is an example for?
(a) decidable problem
(b) undecidable problem
(c) complete problem
(d) trackable problem
I had been asked this question in exam.
My enquiry is from Checksum, Complexity Classes & NP Complete Problems topic in division Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II