

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Notes; Professor: Locklair; Class: Senior Seminar; Subject: Computer Science; University: Concordia University - Wisconsin; Term: Fall 2006;
Typology: Study notes
1 / 2
This page cannot be seen from the preview
Don't miss anything!
6 November – Day 21 Turing Machine is a fundamental CS concept Turing – Alan Turing ~1900-1955, British mathematician wanted to solve the ‘universal computation’ problem TM is a mathematical model of computation (collection of rules) Importance of TM comes from the Turing Thesis which says: TM is the “simplest” computer – anything a computer can do can be done by a TM! Follow handout (chapter 9 of Peter Linz, MCS 825 text) p. 230 – draw tape – tape consists of cells which may contain a symbol draw read/write head – I/O
control unit Processing [note: Linz moves read/write head while Dewdney will move the tape] TM model (picture fig 9.1) Control unit is really a black box “Outward” appearance, operation is simple
Ex: delta (q0, a) = read as (IF) current state is [q0] and read this symbol [a] off tape, (THEN) = (q1, d, R) move to state [q1], write new symbol [d], and move tape [R] TM’s control unit is a collection of many state transition functions Follow through example 9.2 and 9. Visit TM simulator site at www.cs.brown.edu/people/ng/Turing/tmachine.html We have “Visual Turing” installed Chapter 31 in Dewdney Some “insights” into TMs A TM is essentially the same thing as its program (control unit transition functions) Figure 31. note: his quintuple is really same as Linz transition function (q, s, q’, s’, d) current state, current symbol, new state, new symbol, direction to move tape high-level explanation of Multiplication unary system large “program” figure 31.2 beginning and end for next time – read and follow “multiplication” problem in Dewdney Presentations next time CSC 490 Course Notes and Outline, © Dr. Gary Locklair, Fall 2006