{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

notes13 Introduction to Turing Machines

notes13 Introduction to Turing Machines - CS 373 Theory of...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 373: Theory of Computation Gul Agha Mahesh Viswanathan Fall 2010 1
Image of page 1

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

View Full Document Right Arrow Icon
1 Unrestricted Computation General Computing Machines Machines so far: DFAs, NFAs, GNFAs Limitations on how much memory they can use: fixed amount of memory Limitations on what they can compute/decide: only regular languages The complete machine? No limitations on memory usage? And maybe other ways to use computational resources that we haven’t thought of... * Come up with a model that describes all “conceivable” computation No limitation on what they can compute? * No! There are far too many languages over { 0 , 1 } than there are “machines” or programs (as long as machines can be represented digitally) General Computing Machines Alonzo Church, Emil Post, and Alan Turing (1936) Figure 1: Alonzo Church Figure 2: Emil Post 2
Image of page 2
Figure 3: Alan Turing Church ( λ -calculus), Post (Post’s machine), Turing (Turing machine) independently came up with formal definitions of mechanical computation All equivalent! In this course: Turing Machines 2 Turing Machines 2.1 Definition The ‘aha’ moment Figure 4: Turing Machines 3
Image of page 3

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

View Full Document Right Arrow Icon
X 1 X 2 · · · X n t t finite-state control tape head Unrestricted memory: an infinite tape A finite state machine that reads/writes symbols on the tape Can read/write anywhere on the tape Tape is infinite in one direction only (other variants possible) Initially, tape has input and the machine is reading (i.e., tape head is on) the leftmost input symbol. Transition (based on current state and symbol under head): Change control state Overwrite a new symbol on the tape cell under the head Move the head left, or right. Turing Machines Formal Definition A Turing machine is M = ( Q, Σ , Γ , δ, q 0 , q acc , q rej ) where Q is a finite set of control states Σ is a finite set of input symbols Γ Σ is a finite set of tape symbols. Also, a blank symbol
Image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern