October 26

October 26 - CSCI 2670 Introduction to Theory of Computing...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing October 26, 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
October 26, 2005 Agenda Yesterday Test Today Begin Chapter 5  Pages 187 – 192 Old text pages 171 – 176)
Background image of page 2
October 26, 2005 Announcement In Chapter 5 we will skip from page 192 to page  206 Old text skip from 176 to 183 Homework due next Wednesday (11/3) Show the following languages are not decidable T = {<M> | M is a TM with L(M) R  = L(M)} i.e., w R L(M) whenever w L(M) (prob. 5.9) G = {<M> | M is a TM s.t. L(M) is context-free} F = {<M> | M is a TM with |L(M)| = 5}
Background image of page 3

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

View Full DocumentRight Arrow Icon
October 26, 2005 Classes of languages We have shown some language falls within each  of the following classes Regular Context-free Decidable Turing recognizable – Co-Turing recognizable (A TM ) Today we will show some languages are  undecidable
Background image of page 4
October 26, 2005 Undecidable languages Turing recognizable Co-Turing recognizable Decidable
Background image of page 5

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

View Full DocumentRight Arrow Icon
Undecidable languages We can prove a problem is undecidable by 
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 18

October 26 - CSCI 2670 Introduction to Theory of Computing...

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

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