1 / 8

SOLVABLE AND UNSOLVABLE PROBLEMS

SOLVABLE AND UNSOLVABLE PROBLEMS. Kat Munford Instructor: Dr. Binkley CS111.10 Pages: 329-31. TYPES OF PROBLEMS. UNSOLVABLE. SOLVABLE. POLYNOMIAL. NONPOLYMONIAL. ?UNSOLVABLE PROBLEMS?. ~ HALTING PROBLEM ~ IF YOU CAN SOLVE THE HALTING PROBLEM, YOU CAN SOLVE ANY PROBLEM!!.

reuben-monroe
Download Presentation

SOLVABLE AND UNSOLVABLE PROBLEMS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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(n^2) means that the programs does “n^2” operations for “n” inputs.

  6. Polynomial Problems O (log n), O (n), O (n^2)… O(n^k) with k a constant. You can get solutions with a reasonable number of inputs.

  7. Nonpolynomial Problems O (10^n) or O (n!) You can get solutions with only small numbers of inputs (<100)

  8. You have officially learned Solvable and Unsolvable problems. THANK YOU!!!

More Related