Exam-style question
Try this first
A team claims: 'If we spend enough time writing and testing code, every problem will eventually have an algorithmic solution.' Evaluate this claim using the distinction between computable and non-computable problems.
Model answer
What a good answer should say
- The claim is incorrect.
- Some problems are computable, so an algorithmic solution can exist for them and further design, implementation and testing may help produce a working solution.
- However, some problems are non-computable, meaning that no algorithm can solve them in every case.
- Spending more time writing code cannot overcome the absence of an algorithmic solution.
Explanation
Why this works
A complete response should acknowledge both categories of problem, reject the claim that all problems can be solved algorithmically, and avoid confusing difficulty or lack of progress with non-computability.
Common mistake
No common mistake is linked to this question yet.