Exam-style question
Try this first
Which conclusion is justified when a programmer has not yet found an algorithm for a problem?.
- A.The problem is definitely non-computable
- B.The problem is definitely computable
- C.No definite conclusion about computability follows from this alone
- D.The problem must be solved by changing programming language
Model answer
What a good answer should say
- No definite conclusion about computability follows from this alone
Explanation
Why this works
Failure to find an algorithm is not proof that no algorithm exists. A problem is identified as non-computable only when it is established that it cannot be solved algorithmically.
Common mistake
No common mistake is linked to this question yet.