Solving hard problems

A software engineer is developing a new operating system. The operating system has to make a decision when it sees an application taking a long time to finish executing an instruction. Should the operating system force quit the application, assuming it will run forever? Or can the operating system detect that the application will finish processing, if it has a bit more time?

The engineer does some research and discovers that this is an undecidable problem.

What are the implications of the problem being undecidable?

(Choice A)
The problem may be solvable in some cases, but there is no algorithm that will solve the problem in all cases.
(Choice B)
The problem is not solvable in any cases.
(Choice C)
The problem is solvable, but will take an unreasonable amount of time.
(Choice D)
The problem can be solved much more quickly with the use of a heuristic that comes up with an approximate solution.

AP®︎/College Computer Science Principles

Course: AP®︎/College Computer Science Principles > Unit 4

Problem