1 / 12

CSCI 2670 Introduction to Theory of Computing

CSCI 2670 Introduction to Theory of Computing. October 21, 2004. Announcements. Agenda. Today Finish Chapter 4 Next week Go over Turing machines and decidability Begin Chapter 5 No tutorial today. Countable sets. Let N = {1, 2, 3, …} be the set of natural numbers

braima
Download Presentation

CSCI 2670 Introduction to Theory of Computing

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. CSCI 2670Introduction to Theory of Computing October 21, 2004

  2. Announcements Agenda • Today • Finish Chapter 4 • Next week • Go over Turing machines and decidability • Begin Chapter 5 • No tutorial today October 21, 2004

  3. Countable sets • Let N = {1, 2, 3, …} be the set of natural numbers • The set A is countable if … • A is finite, or • |A| = |N| • Some example of countable sets • Integers • {x | x  Z and x = 1 (mod 3)} October 21, 2004

  4. The positive rational numbers • Is Q = {m/n | m,n  N} countable? • Yes! Etc… October 21, 2004

  5. The real numbers • Is R+ (the set of positive real numbers) countable? • No! X = 4.1337… Diagonalization October 21, 2004

  6. The set of all infinite binary strings • Is the set of all infinite binary strings countable? • No • Diagonalization also works to prove this is not countable October 21, 2004

  7. Is the set of all languages in Σ* countable? • No • This set has the same cardinality as the set of binary strings Σ* = {ε, a, b, aa, ab, ba, bb, aaa, aab, …} A = { a, ab, aaa, …} A = 0 1 0 0 1 0 0 1 … October 21, 2004

  8. Is the set of all TM’s countable? • Yes • Since all Turing machines can be represented by a string, the set of all Turing machines are countable Theorem: Some languages are not Turing-recognizable Proof: There are more languages than there are Turing machines October 21, 2004

  9. Undecidability of halting problem Theorem: ATM is undecidable Proof: (By contradiction) Assume ATM is decidable and let H be a decider for ATM H(<M,w>) = { accept if M accepts w reject if M does not accept w October 21, 2004

  10. Proof (cont.) • Consider the TM D that submits the string <M> as input to the TM M D = “On input <M>, where M is a TM: • Run H on input <M,<M>> • If H accepts <M,<M>>, reject • If H rejects <M,<M>>, accept • Since H is a decider, it must accept or reject • Therefore, D is a decider as well October 21, 2004

  11. Proof (cont.) • What happens if D’ input is <D>? D(<D>) = { • D cannot exist! • Therefore, H cannot exist – i.e., ATM is undecidable reject if D accepts <D> accept if D does not accept <D> October 21, 2004

  12. Have a fabulous weekend

More Related