November 2

November 2 - CSCI 2670 Introduction to Theory of Computing...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing November 2, 2005
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
November 2, 2005 Agenda Yesterday Two undecidability proofs REGULAR TM Rice’s Theorem Today Reductions (Section 5.3) Tomorrow Section 6.3 & part of 6.4
Background image of page 2
November 2, 2005 Announcements Quiz tomorrow Undecidability proofs Pizza party! You are all invited to my house for pizza and snacks Wednesday, November 9 at 6:30 PM Please send me an email and let me know if you want to come! Let me know of any special dietary requirements so I can accommodate everyone Announcements
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
November 2, 2005 Reductions and decidability To prove a language is decidable, we have converted it to another language and used the decidability of that language Example – use decidability of E DFA to determine decidability of EQ DFA Thus, we reduce the problem of determining if EQ DFA is decidable to the problem of determining if E DFA is decidable
Background image of page 4
November 2, 2005 Reductions and undecidability
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 12

November 2 - CSCI 2670 Introduction to Theory of Computing...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online