Undecidable problems: AP CSP practice
Problems no algorithm can solve. 3 questions in the style of the AP CSP exam.
Sample questions
What does it mean for a problem to be undecidable?
- It takes a long time to solve on a slow computer
- No algorithm can always give a correct yes-or-no answer for every possible input
- It has more than one correct answer
- It can only be solved using parallel computing