October 11

October 11 - 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 11, 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 11, 2005 Agenda • Last week – Prove equivalence of deterministic and nondeterministic Turing machines •Today – Enumerators – Definition of algorithm – Another class of languages •Dec
Background image of page 2
October 11, 2005 Announcements • Quiz tomorrow – High-level description of TM – Trace through a TM’s operation – High-level description of equivalences • Homework due next Tuesday (10/18) – 4.4, 4.6, 4.7, 4.12, 4.19 • Old text 4.4, 4.7, 4.8, 4.11, 4.19
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 11, 2005 Enumerators • Instead of reading an input and processing it, enumerators start with an empty tape and print out strings in Σ * M Printer 1 1 2 1 3 ~ ~ ~ aaba bbcc aaaaabb
Background image of page 4
October 11, 2005 Machine equivalence Theorem: A language is Turing- recognizable if and only of some enumerator enumerates it. Proof technique: Construction in each direction
Background image of page 5

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

View Full DocumentRight Arrow Icon
TM accept enumerator language • TM = “On input w: – Run enumerator E. Every time E prints a string, compare it to w.
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 / 21

October 11 - 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