Question 1 of 10
Which statement describes an undecidable problem?
- A. Every algorithm finishes in one step
- B. The problem has a known linear-time solution for all inputs
- C. No algorithm can be constructed that always produces a correct yes-or-no answer for every input
- D. The only issue is that printers are offline