5 Steps to a 5 AP Computer Science Principles by Julie Sway

Author:Julie Sway
Language: eng
Format: epub
Publisher: McGraw-Hill Education
Published: 2018-09-22T16:00:00+00:00

Undecidable/Unsolvable Problems

These are problems that cannot be solved. There is no algorithm that can solve all cases of the problem. A decidable problem is one where an algorithm can be written that results in a “yes” or “no” answer for all inputs. Determining if a number is prime is an example of a decidable problem.

In contrast, an undecidable problem does not have an algorithm that can give a correct “yes” or “no” for each instance. The Halting Problem is one example of an unsolvable problem. It states that “given an arbitrary computer program, with an arbitrary input, decide whether it has an infinite loop.”

NOTE: You will not have to determine whether a problem is undecidable on the AP exam.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.