Exam-style question
Try this first
A developer says, 'If an algorithm is correct, hardware cannot prevent it from solving any input.' Assess this statement in relation to limits of computation.
Model answer
What a good answer should say
- The statement is not correct in practical terms.
- An algorithm may be logically correct, but its resource requirements can grow as the input becomes larger.
- If its algorithmic complexity causes it to need an excessive amount of processing time or memory, the available hardware may not be able to complete the computation within a useful time or may not have enough memory.
- Therefore, correctness does not guarantee practical feasibility for every input.
Explanation
Why this works
A high-quality response evaluates rather than simply rejects the claim. It identifies algorithmic complexity, finite hardware resources, and the distinction between a computation being impractical on particular hardware and a problem being impossible in every circumstance.
Common mistake
No common mistake is linked to this question yet.