1 / 17

Reducibility

Reducibility. Text book Pages 187– 199. Reducibility. A reduction is a way of converting one problem to another problem in such a way that a solution to the second problem can be used to solve the first problem . Example: find your way around a new city – using a map.

schuyler
Download Presentation

Reducibility

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. Reducibility

  2. Text book Pages 187– 199

  3. Reducibility • A reductionis a way of converting one problem to another problem in such a way that a solution to the second problem can be used to solve the first problem. • Example: find your way around a new city – using a map. • Reducibility always involves two problems, which we call A and B. If A reduces to B, we can use a solution to B to solve A.

  4. Reducibility (cont’d) • Reducibility also occurs in mathematical problems. • For example, the problem of measuring the area of a rectangle reduces to the problem of measuring its length and width.

  5. Reducibility (cont’d) • Reducibility plays an important role in classifying problems by decidability and later in complexity theory as well. • When A is reducible to B, solving A cannot be harder than solving B because a solution to B gives a solution to A. • In terms of computability theory, if A is reducible to B and B is decidable, A also is decidable. • If A is undecidable and reducible to B, B is undecidable.

  6. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY

  7. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY PROOF IDEA

  8. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY PROOF IDEA

  9. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY

  10. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY

  11. UNDECIDABLE PROBLEMS FROMLANGUAGE THEORY • context-free language can be shown to be undecidable with similar proofs.

  12. REDUCTIONS VIA COMPUTATION HISTORIES (read only)

  13. A SIMPLE UNDECIDABLE PROBLEM • The phenomenon of undecidability is not confined to problems concerning automata • a collection of dominos, each containing two strings, one on each side. An individual domino looks like

  14. Collection of dominos - match • a collection of dominos looks like The task is to make a list of these dominos (repetitions permitted) so that the string we get by reading off the symbols on the top is the same as the string of symbols on the bottom. This list is called a match

  15. Match may be possible • Reading off the top string we get abcaaabc, which is the same as reading off the bottom. We can also depict this match by deforming the dominos so that the corresponding symbols from top and bottom line up.

  16. Match may not be possible • cannot contain a match because every top string is longer than the corresponding bottom string

More Related