SOLVABLE%20AND%20UNSOLVABLE

1
SOLVABLE AND UNSOLVABLE PROBLEMS
Kat Munford Instructor Dr. Binkley CS111.10 Pages
329-31
2
TYPES OF PROBLEMS

• UNSOLVABLE

• SOLVABLE

• POLYNOMIAL

• NONPOLYMONIAL

3
?UNSOLVABLE PROBLEMS?
HALTING PROBLEM IF YOU CAN SOLVE THE HALTING
PROBLEM, YOU CAN SOLVE ANY PROBLEM!!
IN OTHER WORDS, THE SOLUTION TO UNSOLVABLE
PROBLEMS IS TO FIND THE SOLUTION TO THE ULTIMATE
UNSOLVABLE PROBLEM-THE HALTING PROBLEM.
4
COMPLEXITY
How long does it take to solve the problem?

• Run time- the number of operations executed by
  the computer
• when it runs the program.

• Memory needed

5
Big-O Notation
The simplification of efficiency.
Ex. O(n) means that the programs does n
operations for n inputs. O(n2) means that
the programs does n2 operations for n
inputs.
6
Polynomial Problems
O (log n), O (n), O (n2) O(nk) with k a
constant.
You can get solutions with a reasonable number of
inputs.
7
Nonpolynomial Problems
O (10n) or O (n!)
You can get solutions with only small numbers of
inputs (lt100)
8
You have officially learned Solvable and
Unsolvable problems.
THANK YOU!!!