l9-handout

l9-handout - Outline Turing machines and their languages...

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

View Full Document Right Arrow Icon
David Dill Department of Computer Science 1 Outline Turing machines and their languages. Programming tricks. 2 Turing Machines Models of computation so far have been highly restricted. Next model is really the most general useful of computation. This material is full of surprises. The proof that some problems are undecidable is one of the greatest intellectual accomplishments of humanity. First surprise: There IS a most general model of computation. It seems that all general models of computation have the same power This is called the “Church-Turing thesis.” It’s not really provable, but it seems to be true. The C-T thesis is really amazing when you think about it. 3 Turing Machines Finite control with a tape which is used for input and for unbounded storage. There is a “head” that can read/write the tape. hh Draw a picture ii Tape is infinite in both directions. There is s special “blank” symbol (B). All but a finite number of positions are blank at any given time. Def
Background image of page 1

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

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

This note was uploaded on 03/08/2011 for the course CS 154 taught by Professor Motwani,r during the Winter '08 term at Stanford.

Page1 / 3

l9-handout - Outline Turing machines and their languages...

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

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