November 2

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

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

View Full Document Right Arrow Icon
1 CSCI 2670 Introduction to Theory of Computing November 2, 2005 November 2, 2005 Agenda • Yesterday – Two undecidability proofs •REGULAR TM •R ice ’s Theorem •T o d a y – Reductions (Section 5.3) • Tomorrow November 2, 2005 • Quiz tomorrow – Undecidability proofs •P izza party !
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 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 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

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

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

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